./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_lamport.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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:29,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:29,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:29,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:29,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:29,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:29,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:29,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:29,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:29,317 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:29,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:29,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:29,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:29,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:29,317 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:29,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:29,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:29,318 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:29,319 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:29,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:29,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:29,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:29,320 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2025-03-16 19:42:29,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:29,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:29,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:29,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:29,544 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:29,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-03-16 19:42:30,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6844e66a9/9458fa2384414985b4ea4cd145493f4a/FLAG2b3a3a46b [2025-03-16 19:42:30,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:30,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-03-16 19:42:31,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6844e66a9/9458fa2384414985b4ea4cd145493f4a/FLAG2b3a3a46b [2025-03-16 19:42:31,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6844e66a9/9458fa2384414985b4ea4cd145493f4a [2025-03-16 19:42:31,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:31,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:31,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:31,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:31,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:31,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c29dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31, skipping insertion in model container [2025-03-16 19:42:31,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:31,502 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_lamport.i[23604,23617] [2025-03-16 19:42:31,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:31,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:31,626 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_lamport.i[23604,23617] [2025-03-16 19:42:31,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:31,715 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:31,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31 WrapperNode [2025-03-16 19:42:31,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:31,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:31,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:31,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:31,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,783 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 471 [2025-03-16 19:42:31,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:31,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:31,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:31,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:31,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,824 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 13, 5, 8, 5, 8, 8, 29, 21, 7, 7, 7, 7, 7, 13, 5, 5, 5, 6, 0]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 0, 0, 3, 0, 3, 3, 9, 9, 3, 3, 3, 3, 3, 0, 0, 0, 0, 2, 0]. The 42 writes are split as follows [0, 1, 1, 2, 1, 2, 2, 11, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 0]. [2025-03-16 19:42:31,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:31,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:31,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:31,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:31,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (1/1) ... [2025-03-16 19:42:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:31,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:31,887 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-16 19:42:31,890 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-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:42:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:31,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:42:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:31,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:42:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 19:42:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 19:42:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 19:42:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:32,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:32,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:36,611 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:36,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:36,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:36,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:36,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:36 BoogieIcfgContainer [2025-03-16 19:42:36,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:36,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:36,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:36,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:36,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:31" (1/3) ... [2025-03-16 19:42:36,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed2369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:36, skipping insertion in model container [2025-03-16 19:42:36,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:31" (2/3) ... [2025-03-16 19:42:36,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed2369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:36, skipping insertion in model container [2025-03-16 19:42:36,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:36" (3/3) ... [2025-03-16 19:42:36,628 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2025-03-16 19:42:36,638 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:36,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lamport.i that has 6 procedures, 112 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:42:36,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:36,699 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;@4e5fc6ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:36,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:42:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:42:36,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:36,715 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] [2025-03-16 19:42:36,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:36,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash 507497116, now seen corresponding path program 1 times [2025-03-16 19:42:36,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:36,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338238887] [2025-03-16 19:42:36,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:36,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:42:36,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:42:36,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:37,390 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-16 19:42:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338238887] [2025-03-16 19:42:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338238887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784284431] [2025-03-16 19:42:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:37,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:37,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:37,416 INFO L87 Difference]: Start difference. First operand has 112 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-16 19:42:41,452 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-16 19:42:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:41,512 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2025-03-16 19:42:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:41,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 142 [2025-03-16 19:42:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:41,519 INFO L225 Difference]: With dead ends: 223 [2025-03-16 19:42:41,519 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 19:42:41,523 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-16 19:42:41,525 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 311 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-16 19:42:41,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 311 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:42:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 19:42:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-16 19:42:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:42:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-03-16 19:42:41,567 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 142 [2025-03-16 19:42:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:41,568 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-03-16 19:42:41,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-16 19:42:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-03-16 19:42:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 19:42:41,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:41,573 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] [2025-03-16 19:42:41,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:41,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:41,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash -741097464, now seen corresponding path program 1 times [2025-03-16 19:42:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574437193] [2025-03-16 19:42:41,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:41,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 19:42:41,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 19:42:41,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:41,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:41,908 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-16 19:42:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574437193] [2025-03-16 19:42:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574437193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783892841] [2025-03-16 19:42:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:41,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:41,911 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-16 19:42:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:41,951 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2025-03-16 19:42:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:41,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 144 [2025-03-16 19:42:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:41,953 INFO L225 Difference]: With dead ends: 219 [2025-03-16 19:42:41,953 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 19:42:41,953 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-16 19:42:41,954 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 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-16 19:42:41,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 19:42:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-16 19:42:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:42:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-16 19:42:41,971 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 144 [2025-03-16 19:42:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-16 19:42:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-16 19:42:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-16 19:42:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:42:41,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:41,973 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-16 19:42:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:41,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1903931029, now seen corresponding path program 1 times [2025-03-16 19:42:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468202541] [2025-03-16 19:42:41,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:42:42,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:42:42,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:42,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:42,284 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-16 19:42:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468202541] [2025-03-16 19:42:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468202541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150753272] [2025-03-16 19:42:42,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:42,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:42,290 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-16 19:42:42,292 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-16 19:42:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:42:42,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:42:42,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:42,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:42,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:42,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:42,847 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-16 19:42:42,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:42,987 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-16 19:42:42,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150753272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:42,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:42:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659786894] [2025-03-16 19:42:42,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:42,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:42,989 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-16 19:42:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:43,029 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2025-03-16 19:42:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 145 [2025-03-16 19:42:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:43,035 INFO L225 Difference]: With dead ends: 222 [2025-03-16 19:42:43,036 INFO L226 Difference]: Without dead ends: 113 [2025-03-16 19:42:43,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 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-16 19:42:43,038 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 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-16 19:42:43,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-16 19:42:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-16 19:42:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:42:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-16 19:42:43,051 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 145 [2025-03-16 19:42:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:43,051 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-16 19:42:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-16 19:42:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-16 19:42:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:42:43,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:43,055 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] [2025-03-16 19:42:43,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:42:43,255 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-16 19:42:43,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:43,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1547178229, now seen corresponding path program 2 times [2025-03-16 19:42:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112900340] [2025-03-16 19:42:43,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:43,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-16 19:42:43,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 147 statements. [2025-03-16 19:42:43,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:43,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:43,534 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-16 19:42:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112900340] [2025-03-16 19:42:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112900340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174851538] [2025-03-16 19:42:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:43,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:43,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:43,536 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-16 19:42:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:43,577 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2025-03-16 19:42:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:43,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 147 [2025-03-16 19:42:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:43,580 INFO L225 Difference]: With dead ends: 217 [2025-03-16 19:42:43,582 INFO L226 Difference]: Without dead ends: 167 [2025-03-16 19:42:43,582 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-16 19:42:43,583 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 99 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 488 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-16 19:42:43,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 488 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-16 19:42:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-16 19:42:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-16 19:42:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 240 transitions. [2025-03-16 19:42:43,605 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 240 transitions. Word has length 147 [2025-03-16 19:42:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:43,606 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 240 transitions. [2025-03-16 19:42:43,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-16 19:42:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 240 transitions. [2025-03-16 19:42:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 19:42:43,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:43,609 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 19:42:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:43,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash -507693242, now seen corresponding path program 1 times [2025-03-16 19:42:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792515855] [2025-03-16 19:42:43,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:43,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 19:42:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 19:42:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-16 19:42:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792515855] [2025-03-16 19:42:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792515855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960778818] [2025-03-16 19:42:43,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:43,917 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-16 19:42:43,918 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-16 19:42:44,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 19:42:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 19:42:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:44,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:44,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-16 19:42:44,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-16 19:42:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960778818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:44,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-03-16 19:42:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148578768] [2025-03-16 19:42:44,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:44,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:44,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:44,539 INFO L87 Difference]: Start difference. First operand 167 states and 240 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-16 19:42:46,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:50,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:50,664 INFO L93 Difference]: Finished difference Result 337 states and 485 transitions. [2025-03-16 19:42:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 216 [2025-03-16 19:42:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:50,669 INFO L225 Difference]: With dead ends: 337 [2025-03-16 19:42:50,669 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 19:42:50,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 429 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-16 19:42:50,670 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 2 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:50,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 610 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-03-16 19:42:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 19:42:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-16 19:42:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-16 19:42:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 252 transitions. [2025-03-16 19:42:50,689 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 252 transitions. Word has length 216 [2025-03-16 19:42:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:50,689 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 252 transitions. [2025-03-16 19:42:50,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-16 19:42:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 252 transitions. [2025-03-16 19:42:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:42:50,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:50,697 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 19:42:50,710 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-16 19:42:50,899 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-16 19:42:50,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:50,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1355592538, now seen corresponding path program 2 times [2025-03-16 19:42:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040802907] [2025-03-16 19:42:50,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:51,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-03-16 19:42:51,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 226 statements. [2025-03-16 19:42:51,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:51,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-03-16 19:42:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040802907] [2025-03-16 19:42:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040802907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:51,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:51,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028557132] [2025-03-16 19:42:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:51,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:51,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:51,241 INFO L87 Difference]: Start difference. First operand 177 states and 252 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 19:42:55,265 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-16 19:42:59,276 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-16 19:42:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:59,383 INFO L93 Difference]: Finished difference Result 471 states and 678 transitions. [2025-03-16 19:42:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:59,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 226 [2025-03-16 19:42:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:59,388 INFO L225 Difference]: With dead ends: 471 [2025-03-16 19:42:59,388 INFO L226 Difference]: Without dead ends: 327 [2025-03-16 19:42:59,390 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-16 19:42:59,391 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 142 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 659 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-16 19:42:59,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 659 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-16 19:42:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-16 19:42:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2025-03-16 19:42:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 207 states have internal predecessors, (264), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-03-16 19:42:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 469 transitions. [2025-03-16 19:42:59,442 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 469 transitions. Word has length 226 [2025-03-16 19:42:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:59,442 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 469 transitions. [2025-03-16 19:42:59,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 19:42:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 469 transitions. [2025-03-16 19:42:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:42:59,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:59,445 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 19:42:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:42:59,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1922678300, now seen corresponding path program 1 times [2025-03-16 19:42:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679103135] [2025-03-16 19:42:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:59,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:42:59,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:42:59,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:59,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2025-03-16 19:43:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679103135] [2025-03-16 19:43:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679103135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593297067] [2025-03-16 19:43:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:00,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:00,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:00,069 INFO L87 Difference]: Start difference. First operand 323 states and 469 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 19:43:01,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:05,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:05,831 INFO L93 Difference]: Finished difference Result 593 states and 848 transitions. [2025-03-16 19:43:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 226 [2025-03-16 19:43:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:05,836 INFO L225 Difference]: With dead ends: 593 [2025-03-16 19:43:05,836 INFO L226 Difference]: Without dead ends: 297 [2025-03-16 19:43:05,837 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-16 19:43:05,839 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 138 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:05,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 663 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-03-16 19:43:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-16 19:43:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2025-03-16 19:43:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 188 states have (on average 1.2340425531914894) internal successors, (232), 188 states have internal predecessors, (232), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (94), 86 states have call predecessors, (94), 86 states have call successors, (94) [2025-03-16 19:43:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2025-03-16 19:43:05,857 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 412 transitions. Word has length 226 [2025-03-16 19:43:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:05,857 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 412 transitions. [2025-03-16 19:43:05,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 19:43:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 412 transitions. [2025-03-16 19:43:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:43:05,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:05,860 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 19:43:05,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:05,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -224130334, now seen corresponding path program 1 times [2025-03-16 19:43:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844563058] [2025-03-16 19:43:05,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:43:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:43:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-16 19:43:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844563058] [2025-03-16 19:43:06,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844563058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:06,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920036483] [2025-03-16 19:43:06,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:06,387 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-16 19:43:06,389 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-16 19:43:06,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:43:08,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:43:08,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:08,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:43:08,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-03-16 19:43:08,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-16 19:43:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920036483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:08,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-16 19:43:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017399840] [2025-03-16 19:43:08,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:08,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:43:08,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:08,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:43:08,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:43:08,598 INFO L87 Difference]: Start difference. First operand 293 states and 412 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-03-16 19:43:12,633 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-16 19:43:16,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:20,661 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-16 19:43:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:21,371 INFO L93 Difference]: Finished difference Result 585 states and 835 transitions. [2025-03-16 19:43:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:43:21,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 226 [2025-03-16 19:43:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:21,375 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:43:21,375 INFO L226 Difference]: Without dead ends: 315 [2025-03-16 19:43:21,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 451 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-16 19:43:21,377 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 164 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 89 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:21,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 663 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 568 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-03-16 19:43:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-16 19:43:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2025-03-16 19:43:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 206 states have (on average 1.2572815533980584) internal successors, (259), 208 states have internal predecessors, (259), 77 states have call successors, (77), 26 states have call predecessors, (77), 28 states have return successors, (97), 77 states have call predecessors, (97), 77 states have call successors, (97) [2025-03-16 19:43:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 433 transitions. [2025-03-16 19:43:21,400 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 433 transitions. Word has length 226 [2025-03-16 19:43:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:21,401 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 433 transitions. [2025-03-16 19:43:21,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-03-16 19:43:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 433 transitions. [2025-03-16 19:43:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:43:21,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:21,404 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 19:43:21,447 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-16 19:43:21,605 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-16 19:43:21,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1698939230, now seen corresponding path program 1 times [2025-03-16 19:43:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593289792] [2025-03-16 19:43:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:21,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:43:21,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:43:21,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:21,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-16 19:43:23,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593289792] [2025-03-16 19:43:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593289792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371301409] [2025-03-16 19:43:23,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:23,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:23,415 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-16 19:43:23,417 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-16 19:43:23,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:43:24,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:43:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:24,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 19:43:24,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:24,244 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-16 19:43:34,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:43:34,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:43:34,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-03-16 19:43:35,036 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-16 19:43:35,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-16 19:44:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 397 proven. 4 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2025-03-16 19:44:05,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:05,409 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-16 19:44:05,414 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-16 19:44:05,913 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-16 19:44:05,917 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-16 19:44:05,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-16 19:44:05,975 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-16 19:44:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-16 19:44:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371301409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:44:06,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:44:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-03-16 19:44:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652143044] [2025-03-16 19:44:06,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 19:44:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:06,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 19:44:06,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1191, Unknown=3, NotChecked=0, Total=1332 [2025-03-16 19:44:06,053 INFO L87 Difference]: Start difference. First operand 312 states and 433 transitions. Second operand has 37 states, 34 states have (on average 4.029411764705882) internal successors, (137), 34 states have internal predecessors, (137), 18 states have call successors, (72), 12 states have call predecessors, (72), 14 states have return successors, (72), 16 states have call predecessors, (72), 18 states have call successors, (72) [2025-03-16 19:44:10,205 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 []