./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.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 d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:24:48,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:24:48,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:24:48,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:24:48,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:24:48,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:24:48,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:24:48,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:24:48,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:24:48,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:24:48,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:24:48,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:24:48,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:24:48,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:24:48,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:24:48,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:24:48,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:48,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:24:48,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef [2025-03-03 15:24:48,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:24:48,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:24:48,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:24:48,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:24:48,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:24:48,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-03-03 15:24:49,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398d531b3/9ab3d42f4dab48b6a765e8732b11ae58/FLAGdfa46640e [2025-03-03 15:24:50,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:24:50,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-03-03 15:24:50,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398d531b3/9ab3d42f4dab48b6a765e8732b11ae58/FLAGdfa46640e [2025-03-03 15:24:50,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398d531b3/9ab3d42f4dab48b6a765e8732b11ae58 [2025-03-03 15:24:50,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:24:50,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:24:50,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:50,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:24:50,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:24:50,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ef5295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50, skipping insertion in model container [2025-03-03 15:24:50,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:24:50,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i[23611,23624] [2025-03-03 15:24:50,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:50,827 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:24:50,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i[23611,23624] [2025-03-03 15:24:50,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:50,931 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:24:50,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50 WrapperNode [2025-03-03 15:24:50,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:50,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:50,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:24:50,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:24:50,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,970 INFO L138 Inliner]: procedures = 145, calls = 326, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 529 [2025-03-03 15:24:50,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:50,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:24:50,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:24:50,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:24:50,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,018 INFO L175 MemorySlicer]: Split 173 memory accesses to 19 slices as follows [2, 8, 5, 8, 8, 29, 21, 5, 7, 8, 8, 5, 5, 13, 6, 0, 13, 17, 5]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 3, 0, 3, 3, 9, 9, 0, 3, 3, 3, 0, 0, 0, 2, 0, 0, 6, 0]. The 43 writes are split as follows [0, 2, 1, 2, 2, 11, 6, 1, 2, 2, 2, 1, 1, 1, 2, 0, 1, 5, 1]. [2025-03-03 15:24:51,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:24:51,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:24:51,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:24:51,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:24:51,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:51,095 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) [2025-03-03 15:24:51,100 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 [2025-03-03 15:24:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:24:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 15:24:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:24:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:24:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:24:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:24:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 15:24:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:24:51,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:24:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:24:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:24:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:24:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:24:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:24:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-03-03 15:24:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:24:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:24:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:24:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:51,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:24:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:24:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:24:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:24:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:24:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_destroy [2025-03-03 15:24:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_destroy [2025-03-03 15:24:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:24:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:24:51,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:24:51,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:24:55,870 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-03 15:24:55,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:24:55,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:24:55,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:24:55,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:55 BoogieIcfgContainer [2025-03-03 15:24:55,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:24:55,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:24:55,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:24:55,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:24:55,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:24:50" (1/3) ... [2025-03-03 15:24:55,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:55, skipping insertion in model container [2025-03-03 15:24:55,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (2/3) ... [2025-03-03 15:24:55,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22be99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:55, skipping insertion in model container [2025-03-03 15:24:55,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:55" (3/3) ... [2025-03-03 15:24:55,889 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_time_var_mutex.i [2025-03-03 15:24:55,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:24:55,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_time_var_mutex.i that has 8 procedures, 143 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 15:24:55,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:24:55,959 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;@56a0ab3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:24:55,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:24:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 90 states have internal predecessors, (118), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 15:24:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 15:24:55,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:55,975 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:55,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2071858326, now seen corresponding path program 1 times [2025-03-03 15:24:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:55,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008307014] [2025-03-03 15:24:55,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 15:24:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 15:24:56,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:56,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:24:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008307014] [2025-03-03 15:24:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008307014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290183724] [2025-03-03 15:24:56,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:56,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:56,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:56,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:56,647 INFO L87 Difference]: Start difference. First operand has 143 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 90 states have internal predecessors, (118), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:00,677 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 [] [2025-03-03 15:25:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:00,750 INFO L93 Difference]: Finished difference Result 284 states and 453 transitions. [2025-03-03 15:25:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:25:00,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-03-03 15:25:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:00,758 INFO L225 Difference]: With dead ends: 284 [2025-03-03 15:25:00,758 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 15:25:00,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:25:00,766 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:00,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 403 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 15:25:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 15:25:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2025-03-03 15:25:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 15:25:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-03-03 15:25:00,810 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 143 [2025-03-03 15:25:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:00,811 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-03-03 15:25:00,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-03-03 15:25:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 15:25:00,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:00,821 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:00,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:25:00,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:00,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1983700950, now seen corresponding path program 1 times [2025-03-03 15:25:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348782434] [2025-03-03 15:25:00,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 15:25:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 15:25:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:25:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348782434] [2025-03-03 15:25:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348782434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:01,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:01,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:25:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244478910] [2025-03-03 15:25:01,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:25:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:25:01,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:25:01,132 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,168 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-03-03 15:25:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:25:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-03 15:25:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:01,170 INFO L225 Difference]: With dead ends: 278 [2025-03-03 15:25:01,171 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 15:25:01,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:25:01,172 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 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 [2025-03-03 15:25:01,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 15:25:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-03 15:25:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 15:25:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-03 15:25:01,188 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2025-03-03 15:25:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-03 15:25:01,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-03 15:25:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 15:25:01,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:01,192 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:25:01,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 307689499, now seen corresponding path program 1 times [2025-03-03 15:25:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192966297] [2025-03-03 15:25:01,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:25:01,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:25:01,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:25:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192966297] [2025-03-03 15:25:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192966297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848402913] [2025-03-03 15:25:01,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:01,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:01,485 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) [2025-03-03 15:25:01,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:25:01,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:25:01,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:25:01,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:25:01,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:25:01,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 15:25:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848402913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:02,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:25:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305889710] [2025-03-03 15:25:02,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:25:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:02,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:25:02,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:02,117 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 15:25:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:02,154 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2025-03-03 15:25:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:25:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 146 [2025-03-03 15:25:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:02,157 INFO L225 Difference]: With dead ends: 281 [2025-03-03 15:25:02,157 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 15:25:02,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:02,159 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 15:25:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-03 15:25:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 15:25:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-03-03 15:25:02,173 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 146 [2025-03-03 15:25:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-03-03 15:25:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 15:25:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-03-03 15:25:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:25:02,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:02,176 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:02,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:25:02,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:02,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -143326341, now seen corresponding path program 2 times [2025-03-03 15:25:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765041141] [2025-03-03 15:25:02,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:25:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:02,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-03 15:25:02,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 148 statements. [2025-03-03 15:25:02,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:25:02,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-03-03 15:25:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765041141] [2025-03-03 15:25:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765041141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210503676] [2025-03-03 15:25:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:02,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:02,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:02,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:02,679 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:02,733 INFO L93 Difference]: Finished difference Result 276 states and 405 transitions. [2025-03-03 15:25:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:02,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-03 15:25:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:02,736 INFO L225 Difference]: With dead ends: 276 [2025-03-03 15:25:02,739 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 15:25:02,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:02,740 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 142 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:02,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 667 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 15:25:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-03 15:25:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-03-03 15:25:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2025-03-03 15:25:02,768 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 148 [2025-03-03 15:25:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:02,768 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2025-03-03 15:25:02,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 15:25:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2025-03-03 15:25:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 15:25:02,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:02,772 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:02,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:25:02,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:02,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1333080660, now seen corresponding path program 1 times [2025-03-03 15:25:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:02,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479882202] [2025-03-03 15:25:02,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:02,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 15:25:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 15:25:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-03-03 15:25:03,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:03,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479882202] [2025-03-03 15:25:03,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479882202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:03,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990544357] [2025-03-03 15:25:03,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:03,162 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) [2025-03-03 15:25:03,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:25:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 15:25:03,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 15:25:03,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:03,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:03,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:25:03,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-03-03 15:25:03,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-03-03 15:25:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990544357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:04,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:25:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492593097] [2025-03-03 15:25:04,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:04,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:25:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:04,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:25:04,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:04,111 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-03 15:25:08,183 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 [] [2025-03-03 15:25:12,195 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 [] [2025-03-03 15:25:16,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:16,757 INFO L93 Difference]: Finished difference Result 454 states and 666 transitions. [2025-03-03 15:25:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:25:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 262 [2025-03-03 15:25:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:16,762 INFO L225 Difference]: With dead ends: 454 [2025-03-03 15:25:16,762 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 15:25:16,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:16,765 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:16,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-03 15:25:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 15:25:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-03 15:25:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 154 states have internal predecessors, (203), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-03-03 15:25:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 343 transitions. [2025-03-03 15:25:16,784 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 343 transitions. Word has length 262 [2025-03-03 15:25:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:16,785 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 343 transitions. [2025-03-03 15:25:16,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-03 15:25:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 343 transitions. [2025-03-03 15:25:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 15:25:16,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:16,789 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:16,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:25:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:16,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1724727628, now seen corresponding path program 2 times [2025-03-03 15:25:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007665414] [2025-03-03 15:25:16,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:25:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:17,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-03 15:25:17,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 272 statements. [2025-03-03 15:25:17,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:25:17,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2025-03-03 15:25:17,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:17,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007665414] [2025-03-03 15:25:17,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007665414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:17,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:17,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521261257] [2025-03-03 15:25:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:17,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:17,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:17,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:17,367 INFO L87 Difference]: Start difference. First operand 236 states and 343 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:25:21,383 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 [] [2025-03-03 15:25:25,398 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 [] [2025-03-03 15:25:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:25,489 INFO L93 Difference]: Finished difference Result 646 states and 949 transitions. [2025-03-03 15:25:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 272 [2025-03-03 15:25:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:25,494 INFO L225 Difference]: With dead ends: 646 [2025-03-03 15:25:25,495 INFO L226 Difference]: Without dead ends: 444 [2025-03-03 15:25:25,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:25,497 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 186 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:25,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 834 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 15:25:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-03 15:25:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2025-03-03 15:25:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 280 states have internal predecessors, (369), 131 states have call successors, (131), 28 states have call predecessors, (131), 28 states have return successors, (150), 131 states have call predecessors, (150), 131 states have call successors, (150) [2025-03-03 15:25:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 650 transitions. [2025-03-03 15:25:25,537 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 650 transitions. Word has length 272 [2025-03-03 15:25:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:25,537 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 650 transitions. [2025-03-03 15:25:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:25:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 650 transitions. [2025-03-03 15:25:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 15:25:25,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:25,543 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:25,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:25:25,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:25,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2108910932, now seen corresponding path program 1 times [2025-03-03 15:25:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:25,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3674621] [2025-03-03 15:25:25,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:25,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:25,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:25,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:25,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2025-03-03 15:25:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3674621] [2025-03-03 15:25:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3674621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:26,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564839440] [2025-03-03 15:25:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:26,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:26,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:26,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:26,282 INFO L87 Difference]: Start difference. First operand 440 states and 650 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:25:30,295 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 [] [2025-03-03 15:25:34,304 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 [] [2025-03-03 15:25:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:34,424 INFO L93 Difference]: Finished difference Result 811 states and 1186 transitions. [2025-03-03 15:25:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:34,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 272 [2025-03-03 15:25:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:34,428 INFO L225 Difference]: With dead ends: 811 [2025-03-03 15:25:34,428 INFO L226 Difference]: Without dead ends: 399 [2025-03-03 15:25:34,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:34,430 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 182 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:34,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 839 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 15:25:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-03 15:25:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2025-03-03 15:25:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 252 states have (on average 1.2658730158730158) internal successors, (319), 252 states have internal predecessors, (319), 117 states have call successors, (117), 25 states have call predecessors, (117), 25 states have return successors, (129), 117 states have call predecessors, (129), 117 states have call successors, (129) [2025-03-03 15:25:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 565 transitions. [2025-03-03 15:25:34,462 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 565 transitions. Word has length 272 [2025-03-03 15:25:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:34,462 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 565 transitions. [2025-03-03 15:25:34,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:25:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 565 transitions. [2025-03-03 15:25:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 15:25:34,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:34,467 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:25:34,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash 811645964, now seen corresponding path program 1 times [2025-03-03 15:25:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297939024] [2025-03-03 15:25:34,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 15:25:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:35,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297939024] [2025-03-03 15:25:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297939024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174580236] [2025-03-03 15:25:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:35,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:35,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:25:35,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:35,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:35,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:35,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:25:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2025-03-03 15:25:35,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:25:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174580236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:35,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:25:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-03 15:25:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608786277] [2025-03-03 15:25:35,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:25:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:35,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:25:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:25:35,897 INFO L87 Difference]: Start difference. First operand 395 states and 565 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 15:25:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:37,019 INFO L93 Difference]: Finished difference Result 1026 states and 1461 transitions. [2025-03-03 15:25:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:25:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 272 [2025-03-03 15:25:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:37,023 INFO L225 Difference]: With dead ends: 1026 [2025-03-03 15:25:37,023 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 15:25:37,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:25:37,025 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 323 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:37,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 549 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:25:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 15:25:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 627. [2025-03-03 15:25:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 397 states have (on average 1.1939546599496222) internal successors, (474), 398 states have internal predecessors, (474), 182 states have call successors, (182), 39 states have call predecessors, (182), 47 states have return successors, (220), 189 states have call predecessors, (220), 182 states have call successors, (220) [2025-03-03 15:25:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 876 transitions. [2025-03-03 15:25:37,065 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 876 transitions. Word has length 272 [2025-03-03 15:25:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:37,065 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 876 transitions. [2025-03-03 15:25:37,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 4 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 15:25:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 876 transitions. [2025-03-03 15:25:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 15:25:37,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:37,071 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:37,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:25:37,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:37,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1982854635, now seen corresponding path program 1 times [2025-03-03 15:25:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008747508] [2025-03-03 15:25:37,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:37,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:37,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:37,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:37,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 15:25:37,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008747508] [2025-03-03 15:25:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008747508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611616679] [2025-03-03 15:25:37,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:37,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:37,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:37,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:37,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:25:38,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:38,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:38,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:38,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:25:38,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 616 proven. 4 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-03-03 15:25:38,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 15:25:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611616679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:39,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:25:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496081196] [2025-03-03 15:25:39,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:25:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:39,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:25:39,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:25:39,300 INFO L87 Difference]: Start difference. First operand 627 states and 876 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) [2025-03-03 15:25:43,316 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 [] [2025-03-03 15:25:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:44,200 INFO L93 Difference]: Finished difference Result 1287 states and 1825 transitions. [2025-03-03 15:25:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:25:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) Word has length 272 [2025-03-03 15:25:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:44,208 INFO L225 Difference]: With dead ends: 1287 [2025-03-03 15:25:44,208 INFO L226 Difference]: Without dead ends: 705 [2025-03-03 15:25:44,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:25:44,212 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 367 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 256 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:44,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 593 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 15:25:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-03 15:25:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 680. [2025-03-03 15:25:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 442 states have (on average 1.2307692307692308) internal successors, (544), 444 states have internal predecessors, (544), 170 states have call successors, (170), 54 states have call predecessors, (170), 67 states have return successors, (236), 181 states have call predecessors, (236), 170 states have call successors, (236) [2025-03-03 15:25:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 950 transitions. [2025-03-03 15:25:44,259 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 950 transitions. Word has length 272 [2025-03-03 15:25:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:44,260 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 950 transitions. [2025-03-03 15:25:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) [2025-03-03 15:25:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 950 transitions. [2025-03-03 15:25:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 15:25:44,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:44,265 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:44,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:25:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:44,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 508045739, now seen corresponding path program 1 times [2025-03-03 15:25:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476727300] [2025-03-03 15:25:44,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:44,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:44,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:44,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:44,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 15:25:46,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:46,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476727300] [2025-03-03 15:25:46,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476727300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:46,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759654161] [2025-03-03 15:25:46,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:46,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:46,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:25:46,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 15:25:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 15:25:47,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:47,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:47,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 15:25:47,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:47,372 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 13 treesize of output 9 [2025-03-03 15:25:53,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:25:53,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:25:53,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-03 15:25:56,192 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-03 15:25:56,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-03 15:26:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 742 proven. 4 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-03 15:26:14,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:26:15,148 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 25 treesize of output 23 [2025-03-03 15:26:15,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 15:26:15,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-03 15:26:15,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-03 15:26:15,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-03 15:26:15,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-03 15:26:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-03 15:26:15,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759654161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:26:15,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:26:15,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-03-03 15:26:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100800416] [2025-03-03 15:26:15,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:26:15,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 15:26:15,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:26:15,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 15:26:15,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1258, Unknown=3, NotChecked=0, Total=1406 [2025-03-03 15:26:15,907 INFO L87 Difference]: Start difference. First operand 680 states and 950 transitions. Second operand has 38 states, 35 states have (on average 4.685714285714286) internal successors, (164), 35 states have internal predecessors, (164), 19 states have call successors, (87), 12 states have call predecessors, (87), 14 states have return successors, (87), 17 states have call predecessors, (87), 19 states have call successors, (87) [2025-03-03 15:26:19,967 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 [] [2025-03-03 15:26:21,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:26:25,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []