./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.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 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:32:20,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:32:20,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:32:20,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:32:20,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:32:20,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:32:20,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:32:20,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:32:20,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:32:20,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:32:20,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:32:20,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:32:20,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:32:20,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:32:20,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:32:20,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:32:20,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:32:20,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:32:20,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:32:20,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:32:20,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:32:20,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:32:20,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:32:20,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:32:20,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:32:20,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:32:20,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:32:20,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:32:20,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:32:20,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:32:20,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:32:20,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:32:20,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:32:20,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:32:20,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:32:20,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:32:20,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:32:20,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:32:20,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:32:20,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:32:20,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:32:20,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:32:20,273 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 -> 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 [2024-10-14 13:32:20,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:32:20,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:32:20,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:32:20,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:32:20,498 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:32:20,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-14 13:32:21,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:32:22,030 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:32:22,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-14 13:32:22,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d5e36b2/293e278af43a48b193a67fd22f687d5a/FLAGf56cf3a44 [2024-10-14 13:32:22,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d5e36b2/293e278af43a48b193a67fd22f687d5a [2024-10-14 13:32:22,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:32:22,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:32:22,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:32:22,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:32:22,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:32:22,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ea086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22, skipping insertion in model container [2024-10-14 13:32:22,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:32:22,594 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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i[917,930] [2024-10-14 13:32:22,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:32:22,692 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:32:22,713 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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i[917,930] [2024-10-14 13:32:22,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:32:22,815 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:32:22,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22 WrapperNode [2024-10-14 13:32:22,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:32:22,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:32:22,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:32:22,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:32:22,835 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:32:22" (1/1) ... [2024-10-14 13:32:22,860 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:32:22" (1/1) ... [2024-10-14 13:32:22,943 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-14 13:32:22,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:32:22,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:32:22,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:32:22,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:32:22,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,991 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2024-10-14 13:32:22,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:22,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:32:23,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:32:23,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:32:23,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:32:23,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (1/1) ... [2024-10-14 13:32:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:32:23,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:32:23,068 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 13:32:23,075 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 13:32:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:32:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:32:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:32:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:32:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:32:23,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:32:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:32:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:32:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:32:23,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:32:23,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:32:23,544 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-14 13:32:23,544 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:32:23,578 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:32:23,579 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:32:23,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:32:23 BoogieIcfgContainer [2024-10-14 13:32:23,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:32:23,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:32:23,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:32:23,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:32:23,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:32:22" (1/3) ... [2024-10-14 13:32:23,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc8305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:32:23, skipping insertion in model container [2024-10-14 13:32:23,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:32:22" (2/3) ... [2024-10-14 13:32:23,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc8305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:32:23, skipping insertion in model container [2024-10-14 13:32:23,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:32:23" (3/3) ... [2024-10-14 13:32:23,587 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-14 13:32:23,602 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:32:23,602 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:32:23,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:32:23,659 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;@7430733c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:32:23,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:32:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:32:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:32:23,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:23,679 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:23,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1166706608, now seen corresponding path program 1 times [2024-10-14 13:32:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378746333] [2024-10-14 13:32:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378746333] [2024-10-14 13:32:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378746333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:24,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:24,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:32:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388040340] [2024-10-14 13:32:24,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:32:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:32:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:32:24,157 INFO L87 Difference]: Start difference. First operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:32:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:24,219 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-14 13:32:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:32:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-14 13:32:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:24,228 INFO L225 Difference]: With dead ends: 187 [2024-10-14 13:32:24,228 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:32:24,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:32:24,236 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:24,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:32:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:32:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 13:32:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:32:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-10-14 13:32:24,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 127 [2024-10-14 13:32:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-10-14 13:32:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:32:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-10-14 13:32:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:32:24,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:24,285 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:24,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:32:24,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1763592878, now seen corresponding path program 1 times [2024-10-14 13:32:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925997295] [2024-10-14 13:32:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925997295] [2024-10-14 13:32:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925997295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:32:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151200678] [2024-10-14 13:32:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:24,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:32:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:32:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:32:24,535 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:24,569 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-10-14 13:32:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:32:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-14 13:32:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:24,571 INFO L225 Difference]: With dead ends: 188 [2024-10-14 13:32:24,571 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 13:32:24,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 13:32:24,572 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:24,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 377 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:32:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 13:32:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-14 13:32:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 13:32:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-14 13:32:24,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 127 [2024-10-14 13:32:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:24,582 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-14 13:32:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-14 13:32:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:32:24,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:24,585 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:24,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:32:24,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:24,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1763533296, now seen corresponding path program 1 times [2024-10-14 13:32:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546090941] [2024-10-14 13:32:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546090941] [2024-10-14 13:32:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546090941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:32:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666435400] [2024-10-14 13:32:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:32:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:32:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:32:25,629 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:25,933 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2024-10-14 13:32:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:32:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-14 13:32:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:25,935 INFO L225 Difference]: With dead ends: 240 [2024-10-14 13:32:25,935 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 13:32:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:32:25,936 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:25,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 730 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:32:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 13:32:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-10-14 13:32:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 122 states have internal predecessors, (162), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:32:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2024-10-14 13:32:25,947 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 127 [2024-10-14 13:32:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:25,948 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2024-10-14 13:32:25,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2024-10-14 13:32:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 13:32:25,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:25,950 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:32:25,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:25,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1510365646, now seen corresponding path program 1 times [2024-10-14 13:32:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194314217] [2024-10-14 13:32:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194314217] [2024-10-14 13:32:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194314217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:26,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:26,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:32:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497473911] [2024-10-14 13:32:26,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:26,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:32:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:26,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:32:26,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:32:26,185 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:26,235 INFO L93 Difference]: Finished difference Result 325 states and 453 transitions. [2024-10-14 13:32:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:32:26,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-14 13:32:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:26,238 INFO L225 Difference]: With dead ends: 325 [2024-10-14 13:32:26,238 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 13:32:26,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:32:26,240 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 45 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:26,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 627 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:32:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 13:32:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 149. [2024-10-14 13:32:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:32:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 208 transitions. [2024-10-14 13:32:26,252 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 208 transitions. Word has length 127 [2024-10-14 13:32:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:26,252 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 208 transitions. [2024-10-14 13:32:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 208 transitions. [2024-10-14 13:32:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:32:26,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:26,257 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:26,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:32:26,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:26,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash 510667031, now seen corresponding path program 1 times [2024-10-14 13:32:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:26,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061580404] [2024-10-14 13:32:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061580404] [2024-10-14 13:32:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061580404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:32:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908894608] [2024-10-14 13:32:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:26,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:32:26,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:26,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:32:26,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:32:26,679 INFO L87 Difference]: Start difference. First operand 149 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:26,946 INFO L93 Difference]: Finished difference Result 386 states and 532 transitions. [2024-10-14 13:32:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:32:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-14 13:32:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:26,948 INFO L225 Difference]: With dead ends: 386 [2024-10-14 13:32:26,948 INFO L226 Difference]: Without dead ends: 238 [2024-10-14 13:32:26,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:32:26,949 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:26,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 740 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:32:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-14 13:32:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2024-10-14 13:32:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 206 states have internal predecessors, (267), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 13:32:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2024-10-14 13:32:26,966 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 321 transitions. Word has length 128 [2024-10-14 13:32:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:26,967 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 321 transitions. [2024-10-14 13:32:26,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 321 transitions. [2024-10-14 13:32:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:32:26,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:26,969 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:26,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:32:26,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash -653720733, now seen corresponding path program 1 times [2024-10-14 13:32:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312072506] [2024-10-14 13:32:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312072506] [2024-10-14 13:32:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312072506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:32:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784281868] [2024-10-14 13:32:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:27,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:32:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:27,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:32:27,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:32:27,395 INFO L87 Difference]: Start difference. First operand 235 states and 321 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:27,758 INFO L93 Difference]: Finished difference Result 671 states and 910 transitions. [2024-10-14 13:32:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 13:32:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-14 13:32:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:27,761 INFO L225 Difference]: With dead ends: 671 [2024-10-14 13:32:27,761 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 13:32:27,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:32:27,762 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:27,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1022 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:32:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 13:32:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 274. [2024-10-14 13:32:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 242 states have (on average 1.334710743801653) internal successors, (323), 245 states have internal predecessors, (323), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 13:32:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 377 transitions. [2024-10-14 13:32:27,783 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 377 transitions. Word has length 129 [2024-10-14 13:32:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:27,783 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 377 transitions. [2024-10-14 13:32:27,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:32:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 377 transitions. [2024-10-14 13:32:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:32:27,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:27,785 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:27,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:32:27,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:27,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1131589696, now seen corresponding path program 1 times [2024-10-14 13:32:27,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389674673] [2024-10-14 13:32:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 13:32:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:28,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389674673] [2024-10-14 13:32:28,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389674673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:32:28,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148291688] [2024-10-14 13:32:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:28,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:32:28,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:32:28,429 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 13:32:28,430 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 13:32:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:28,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 13:32:28,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:32:28,737 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 15 treesize of output 1 [2024-10-14 13:32:29,009 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 27 treesize of output 11 [2024-10-14 13:32:29,550 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 55 treesize of output 39 [2024-10-14 13:32:29,553 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 0 case distinctions, treesize of input 55 treesize of output 41 [2024-10-14 13:32:29,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:32:29,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 61 [2024-10-14 13:32:29,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:32:29,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2024-10-14 13:32:29,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:32:29,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 63 [2024-10-14 13:32:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 211 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-14 13:32:29,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:32:29,853 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 53 treesize of output 37 [2024-10-14 13:32:29,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base))) (and (forall ((v_ArrVal_194 (Array Int Int))) (let ((.cse1 (select v_ArrVal_194 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) (or (not (= v_ArrVal_194 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse1))) (< (+ .cse1 128) 0) (< 0 (+ .cse1 1)) (< 0 (+ (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_194) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) 1))))) (forall ((v_ArrVal_194 (Array Int Int))) (let ((.cse2 (select v_ArrVal_194 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) (or (< 127 .cse2) (not (= v_ArrVal_194 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse2))) (< .cse2 0) (< 0 (+ (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_194) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) 1))))))) is different from false [2024-10-14 13:32:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148291688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:32:30,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:32:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-14 13:32:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211733651] [2024-10-14 13:32:30,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:32:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 13:32:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 13:32:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-10-14 13:32:30,139 INFO L87 Difference]: Start difference. First operand 274 states and 377 transitions. Second operand has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-14 13:32:34,716 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 13:32:38,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:32:42,441 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 13:32:46,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-14 13:32:50,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:32:54,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-14 13:32:58,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:32:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:58,180 INFO L93 Difference]: Finished difference Result 610 states and 826 transitions. [2024-10-14 13:32:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 13:32:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 129 [2024-10-14 13:32:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:58,189 INFO L225 Difference]: With dead ends: 610 [2024-10-14 13:32:58,189 INFO L226 Difference]: Without dead ends: 337 [2024-10-14 13:32:58,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=801, Unknown=1, NotChecked=62, Total=1122 [2024-10-14 13:32:58,191 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 491 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 132 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:58,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 433 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 494 Invalid, 7 Unknown, 0 Unchecked, 27.4s Time] [2024-10-14 13:32:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-14 13:32:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 282. [2024-10-14 13:32:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 248 states have (on average 1.310483870967742) internal successors, (325), 251 states have internal predecessors, (325), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 13:32:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 379 transitions. [2024-10-14 13:32:58,225 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 379 transitions. Word has length 129 [2024-10-14 13:32:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 379 transitions. [2024-10-14 13:32:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-14 13:32:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 379 transitions. [2024-10-14 13:32:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 13:32:58,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:58,229 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:58,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:32:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:32:58,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1389755134, now seen corresponding path program 1 times [2024-10-14 13:32:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786218995] [2024-10-14 13:32:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:32:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:32:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:32:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:32:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:32:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:32:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:32:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:32:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:32:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:32:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:32:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:32:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:32:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:32:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:32:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:32:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:32:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:32:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:32:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:32:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786218995] [2024-10-14 13:32:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786218995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:32:59,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:32:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:32:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226829163] [2024-10-14 13:32:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:32:59,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:32:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:32:59,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:32:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:32:59,166 INFO L87 Difference]: Start difference. First operand 282 states and 379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:32:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:32:59,522 INFO L93 Difference]: Finished difference Result 671 states and 897 transitions. [2024-10-14 13:32:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:32:59,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-14 13:32:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:32:59,524 INFO L225 Difference]: With dead ends: 671 [2024-10-14 13:32:59,524 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 13:32:59,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:32:59,525 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 190 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:32:59,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 663 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:32:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 13:32:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-10-14 13:32:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 343 states have internal predecessors, (436), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:32:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 512 transitions. [2024-10-14 13:32:59,571 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 512 transitions. Word has length 129 [2024-10-14 13:32:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:32:59,571 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 512 transitions. [2024-10-14 13:32:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:32:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 512 transitions. [2024-10-14 13:32:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:32:59,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:32:59,573 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:32:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:32:59,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:32:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:32:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 813283554, now seen corresponding path program 1 times [2024-10-14 13:32:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:32:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694349729] [2024-10-14 13:32:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:32:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:32:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:33:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:33:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:33:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:33:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:33:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:33:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:33:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:33:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:33:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:33:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:33:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:33:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:33:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:33:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:33:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:33:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:33:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:33:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:33:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694349729] [2024-10-14 13:33:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694349729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:33:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:33:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:33:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073567730] [2024-10-14 13:33:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:33:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:33:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:33:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:33:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:33:00,264 INFO L87 Difference]: Start difference. First operand 387 states and 512 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:33:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:33:00,795 INFO L93 Difference]: Finished difference Result 879 states and 1159 transitions. [2024-10-14 13:33:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:33:00,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-14 13:33:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:33:00,801 INFO L225 Difference]: With dead ends: 879 [2024-10-14 13:33:00,801 INFO L226 Difference]: Without dead ends: 493 [2024-10-14 13:33:00,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:33:00,803 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:33:00,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 991 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:33:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-14 13:33:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 407. [2024-10-14 13:33:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.2877094972067038) internal successors, (461), 363 states have internal predecessors, (461), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:33:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2024-10-14 13:33:00,862 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 130 [2024-10-14 13:33:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:33:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2024-10-14 13:33:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 13:33:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2024-10-14 13:33:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:33:00,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:33:00,864 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:33:00,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:33:00,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:33:00,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:33:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1130887143, now seen corresponding path program 1 times [2024-10-14 13:33:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:33:00,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404141226] [2024-10-14 13:33:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:33:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:33:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:33:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:33:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:33:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:33:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:33:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:33:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:33:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:33:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 13:33:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:33:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:33:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:33:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:33:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:33:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:33:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:33:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:33:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 13:33:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:33:01,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404141226] [2024-10-14 13:33:01,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404141226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:33:01,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:33:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:33:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256284337] [2024-10-14 13:33:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:33:01,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:33:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:33:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:33:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:33:01,468 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:33:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:33:01,962 INFO L93 Difference]: Finished difference Result 810 states and 1065 transitions. [2024-10-14 13:33:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:33:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-14 13:33:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:33:01,966 INFO L225 Difference]: With dead ends: 810 [2024-10-14 13:33:01,966 INFO L226 Difference]: Without dead ends: 399 [2024-10-14 13:33:01,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:33:01,967 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 221 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:33:01,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 517 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:33:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-14 13:33:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2024-10-14 13:33:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 346 states have (on average 1.2716763005780347) internal successors, (440), 351 states have internal predecessors, (440), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:33:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-14 13:33:02,010 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 130 [2024-10-14 13:33:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:33:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-14 13:33:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 13:33:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-14 13:33:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:33:02,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:33:02,013 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:33:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:33:02,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:33:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:33:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -403223472, now seen corresponding path program 1 times [2024-10-14 13:33:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:33:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424934239] [2024-10-14 13:33:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:33:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:33:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:33:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302871970] [2024-10-14 13:33:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:33:02,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:33:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:33:02,131 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 13:33:02,135 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 13:33:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:33:02,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-10-14 13:33:03,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:33:03,198 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 7 treesize of output 3 [2024-10-14 13:33:04,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 13:33:06,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 13:33:07,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:33:07,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-10-14 13:33:09,991 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 13:33:11,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-10-14 13:33:13,984 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 15 treesize of output 1 [2024-10-14 13:33:16,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:33:16,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:33:16,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2024-10-14 13:33:16,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:33:16,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:33:16,381 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-14 13:33:16,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 74 [2024-10-14 13:33:21,245 INFO L349 Elim1Store]: treesize reduction 156, result has 63.0 percent of original size [2024-10-14 13:33:21,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 390