./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_sync.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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:35:52,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:35:52,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:35:52,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:35:52,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:35:52,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:35:52,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:35:52,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:35:52,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:35:52,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:35:52,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:35:52,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:35:52,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:35:52,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:35:52,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:35:52,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:35:52,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:52,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:35:52,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:35:52,404 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 -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2025-03-08 06:35:52,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:35:52,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:35:52,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:35:52,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:35:52,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:35:52,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-08 06:35:53,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac923e77/da68a6985ade463c846dd3cb6993dd12/FLAGbcab5fcab [2025-03-08 06:35:54,119 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:35:54,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-08 06:35:54,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac923e77/da68a6985ade463c846dd3cb6993dd12/FLAGbcab5fcab [2025-03-08 06:35:54,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac923e77/da68a6985ade463c846dd3cb6993dd12 [2025-03-08 06:35:54,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:35:54,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:35:54,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:54,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:35:54,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:35:54,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c34d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54, skipping insertion in model container [2025-03-08 06:35:54,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:35:54,658 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_sync.i[34698,34711] [2025-03-08 06:35:54,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:54,735 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:35:54,773 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_sync.i[34698,34711] [2025-03-08 06:35:54,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:54,851 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:35:54,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54 WrapperNode [2025-03-08 06:35:54,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:54,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:54,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:35:54,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:35:54,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,920 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2025-03-08 06:35:54,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:54,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:35:54,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:35:54,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:35:54,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,964 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [2, 8, 8, 8, 20, 16, 12, 0, 6, 7, 3, 8, 3, 7, 12, 3, 3]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 3, 3, 3, 6, 6, 2, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0]. The 38 writes are split as follows [0, 2, 2, 2, 8, 5, 4, 0, 2, 1, 1, 2, 1, 1, 5, 1, 1]. [2025-03-08 06:35:54,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:54,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:55,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:55,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:35:55,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:35:55,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:35:55,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:35:55,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (1/1) ... [2025-03-08 06:35:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:55,038 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-08 06:35:55,041 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-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:35:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2025-03-08 06:35:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:35:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:35:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:35:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:35:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:35:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:35:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:35:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:35:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:35:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:35:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:35:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:35:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:55,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:35:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2025-03-08 06:35:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:35:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:35:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:35:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:35:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:35:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2025-03-08 06:35:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2025-03-08 06:35:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:35:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:35:55,066 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:55,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:35:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:35:55,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:35:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:35:55,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:35:55,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:35:55,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:35:55,559 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:55,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:55,769 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-08 06:35:55,769 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:35:55,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:35:55,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:35:55,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:55 BoogieIcfgContainer [2025-03-08 06:35:55,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:35:55,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:35:55,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:35:55,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:35:55,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:35:54" (1/3) ... [2025-03-08 06:35:55,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a1bada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:55, skipping insertion in model container [2025-03-08 06:35:55,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:54" (2/3) ... [2025-03-08 06:35:55,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a1bada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:55, skipping insertion in model container [2025-03-08 06:35:55,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:55" (3/3) ... [2025-03-08 06:35:55,788 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2025-03-08 06:35:55,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:35:55,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_sync.i that has 11 procedures, 186 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 06:35:55,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:35:55,859 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;@4dcce58b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:35:55,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:35:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 06:35:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:35:55,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:55,872 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:35:55,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:55,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2136996797, now seen corresponding path program 1 times [2025-03-08 06:35:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431150646] [2025-03-08 06:35:55,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:56,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:35:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:35:56,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:56,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431150646] [2025-03-08 06:35:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431150646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602749620] [2025-03-08 06:35:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:56,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:56,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:56,366 INFO L87 Difference]: Start difference. First operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:56,760 INFO L93 Difference]: Finished difference Result 370 states and 607 transitions. [2025-03-08 06:35:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:56,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-08 06:35:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:56,768 INFO L225 Difference]: With dead ends: 370 [2025-03-08 06:35:56,768 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 06:35:56,773 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-08 06:35:56,777 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:56,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 549 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:35:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 06:35:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-08 06:35:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 06:35:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2025-03-08 06:35:56,830 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 71 [2025-03-08 06:35:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2025-03-08 06:35:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2025-03-08 06:35:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:35:56,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:56,838 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:35:56,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:35:56,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1843400155, now seen corresponding path program 1 times [2025-03-08 06:35:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:56,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493303180] [2025-03-08 06:35:56,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:35:56,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:35:56,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:56,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:57,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:57,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493303180] [2025-03-08 06:35:57,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493303180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:57,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:57,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700316924] [2025-03-08 06:35:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:57,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:57,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:57,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:57,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:57,081 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:57,123 INFO L93 Difference]: Finished difference Result 364 states and 551 transitions. [2025-03-08 06:35:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-03-08 06:35:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:57,129 INFO L225 Difference]: With dead ends: 364 [2025-03-08 06:35:57,130 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 06:35:57,130 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-08 06:35:57,131 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 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-08 06:35:57,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 06:35:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-08 06:35:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 06:35:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2025-03-08 06:35:57,144 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 73 [2025-03-08 06:35:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:57,144 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2025-03-08 06:35:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2025-03-08 06:35:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:35:57,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:57,148 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:35:57,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:35:57,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:57,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1015932817, now seen corresponding path program 1 times [2025-03-08 06:35:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508494537] [2025-03-08 06:35:57,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:35:57,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:35:57,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:57,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508494537] [2025-03-08 06:35:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508494537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908991130] [2025-03-08 06:35:57,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:57,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:57,383 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-08 06:35:57,385 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-08 06:35:57,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:35:57,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:35:57,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:57,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:57,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:57,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 06:35:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908991130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:57,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:35:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042875230] [2025-03-08 06:35:57,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:57,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:57,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:57,773 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:57,809 INFO L93 Difference]: Finished difference Result 367 states and 555 transitions. [2025-03-08 06:35:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:35:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-03-08 06:35:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:57,812 INFO L225 Difference]: With dead ends: 367 [2025-03-08 06:35:57,812 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 06:35:57,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-08 06:35:57,813 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 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-08 06:35:57,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 06:35:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-08 06:35:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 120 states have internal predecessors, (169), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 06:35:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 279 transitions. [2025-03-08 06:35:57,837 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 279 transitions. Word has length 74 [2025-03-08 06:35:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:57,837 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 279 transitions. [2025-03-08 06:35:57,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 06:35:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 279 transitions. [2025-03-08 06:35:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:35:57,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:57,842 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-08 06:35:57,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:58,042 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-08 06:35:58,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 507087057, now seen corresponding path program 2 times [2025-03-08 06:35:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606667302] [2025-03-08 06:35:58,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:58,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 06:35:58,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-03-08 06:35:58,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:58,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-08 06:35:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606667302] [2025-03-08 06:35:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606667302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426599209] [2025-03-08 06:35:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:58,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:58,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:58,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:58,280 INFO L87 Difference]: Start difference. First operand 186 states and 279 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:58,315 INFO L93 Difference]: Finished difference Result 362 states and 553 transitions. [2025-03-08 06:35:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-03-08 06:35:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:58,319 INFO L225 Difference]: With dead ends: 362 [2025-03-08 06:35:58,319 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 06:35:58,319 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-08 06:35:58,319 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 237 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:58,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 938 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 06:35:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2025-03-08 06:35:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 215 states have internal predecessors, (308), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-08 06:35:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 514 transitions. [2025-03-08 06:35:58,349 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 514 transitions. Word has length 76 [2025-03-08 06:35:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:58,349 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 514 transitions. [2025-03-08 06:35:58,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 06:35:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 514 transitions. [2025-03-08 06:35:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:35:58,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:58,352 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:58,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:58,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1625760722, now seen corresponding path program 1 times [2025-03-08 06:35:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525111314] [2025-03-08 06:35:58,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:58,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:35:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:35:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-08 06:35:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525111314] [2025-03-08 06:35:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525111314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524262096] [2025-03-08 06:35:58,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:58,628 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-08 06:35:58,630 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-08 06:35:58,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:35:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:35:58,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:58,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:58,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:58,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-08 06:35:58,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-08 06:35:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524262096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:59,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:59,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 06:35:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789077613] [2025-03-08 06:35:59,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:59,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:59,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:59,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:59,137 INFO L87 Difference]: Start difference. First operand 335 states and 514 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 06:35:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:59,250 INFO L93 Difference]: Finished difference Result 667 states and 1025 transitions. [2025-03-08 06:35:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 170 [2025-03-08 06:35:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:59,254 INFO L225 Difference]: With dead ends: 667 [2025-03-08 06:35:59,254 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 06:35:59,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:59,256 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:59,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:35:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 06:35:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-08 06:35:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 220 states have (on average 1.4272727272727272) internal successors, (314), 220 states have internal predecessors, (314), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-08 06:35:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 520 transitions. [2025-03-08 06:35:59,275 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 520 transitions. Word has length 170 [2025-03-08 06:35:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:59,275 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 520 transitions. [2025-03-08 06:35:59,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 06:35:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 520 transitions. [2025-03-08 06:35:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 06:35:59,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:59,278 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:59,286 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-08 06:35:59,479 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-08 06:35:59,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1841553338, now seen corresponding path program 1 times [2025-03-08 06:35:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683301161] [2025-03-08 06:35:59,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:59,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 06:35:59,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 06:35:59,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-08 06:36:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683301161] [2025-03-08 06:36:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683301161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:36:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:36:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998210498] [2025-03-08 06:36:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:00,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:36:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:00,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:36:00,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:36:00,059 INFO L87 Difference]: Start difference. First operand 340 states and 520 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:36:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:00,472 INFO L93 Difference]: Finished difference Result 708 states and 1090 transitions. [2025-03-08 06:36:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:36:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 175 [2025-03-08 06:36:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:00,476 INFO L225 Difference]: With dead ends: 708 [2025-03-08 06:36:00,476 INFO L226 Difference]: Without dead ends: 678 [2025-03-08 06:36:00,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:36:00,478 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 278 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:00,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1141 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:36:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-08 06:36:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 670. [2025-03-08 06:36:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 429 states have (on average 1.4289044289044288) internal successors, (613), 432 states have internal predecessors, (613), 197 states have call successors, (197), 40 states have call predecessors, (197), 43 states have return successors, (231), 197 states have call predecessors, (231), 197 states have call successors, (231) [2025-03-08 06:36:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1041 transitions. [2025-03-08 06:36:00,530 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1041 transitions. Word has length 175 [2025-03-08 06:36:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:00,531 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1041 transitions. [2025-03-08 06:36:00,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:36:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1041 transitions. [2025-03-08 06:36:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 06:36:00,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:00,535 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:36:00,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 684379194, now seen corresponding path program 2 times [2025-03-08 06:36:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009839288] [2025-03-08 06:36:00,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:36:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:00,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-08 06:36:00,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 175 statements. [2025-03-08 06:36:00,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:36:00,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-08 06:36:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009839288] [2025-03-08 06:36:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009839288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:36:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:36:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105481814] [2025-03-08 06:36:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:00,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:36:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:00,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:36:00,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:36:00,694 INFO L87 Difference]: Start difference. First operand 670 states and 1041 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:36:01,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:01,887 INFO L93 Difference]: Finished difference Result 1099 states and 1684 transitions. [2025-03-08 06:36:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:36:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2025-03-08 06:36:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:01,892 INFO L225 Difference]: With dead ends: 1099 [2025-03-08 06:36:01,892 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 06:36:01,893 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-08 06:36:01,894 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 259 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:01,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 894 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:36:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 06:36:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 659. [2025-03-08 06:36:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 421 states have (on average 1.4275534441805227) internal successors, (601), 423 states have internal predecessors, (601), 195 states have call successors, (195), 40 states have call predecessors, (195), 42 states have return successors, (223), 195 states have call predecessors, (223), 195 states have call successors, (223) [2025-03-08 06:36:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1019 transitions. [2025-03-08 06:36:01,950 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1019 transitions. Word has length 175 [2025-03-08 06:36:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:01,950 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1019 transitions. [2025-03-08 06:36:01,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 06:36:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1019 transitions. [2025-03-08 06:36:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 06:36:01,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:01,953 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:36:01,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:01,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:01,953 INFO L85 PathProgramCache]: Analyzing trace with hash -594743398, now seen corresponding path program 1 times [2025-03-08 06:36:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200322472] [2025-03-08 06:36:01,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:02,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 06:36:02,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 06:36:02,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:02,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-08 06:36:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200322472] [2025-03-08 06:36:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200322472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:36:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:36:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38249201] [2025-03-08 06:36:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:36:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:02,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:36:02,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:36:02,428 INFO L87 Difference]: Start difference. First operand 659 states and 1019 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:36:06,557 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-08 06:36:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:06,789 INFO L93 Difference]: Finished difference Result 1024 states and 1565 transitions. [2025-03-08 06:36:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:36:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 175 [2025-03-08 06:36:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:06,794 INFO L225 Difference]: With dead ends: 1024 [2025-03-08 06:36:06,794 INFO L226 Difference]: Without dead ends: 638 [2025-03-08 06:36:06,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:36:06,796 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 307 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:06,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1032 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 06:36:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-08 06:36:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 625. [2025-03-08 06:36:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 403 states have (on average 1.4168734491315136) internal successors, (571), 405 states have internal predecessors, (571), 180 states have call successors, (180), 38 states have call predecessors, (180), 41 states have return successors, (204), 181 states have call predecessors, (204), 180 states have call successors, (204) [2025-03-08 06:36:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 955 transitions. [2025-03-08 06:36:06,845 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 955 transitions. Word has length 175 [2025-03-08 06:36:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:06,845 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 955 transitions. [2025-03-08 06:36:06,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 06:36:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 955 transitions. [2025-03-08 06:36:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 06:36:06,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:06,850 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 06:36:06,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:36:06,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:06,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1528064126, now seen corresponding path program 1 times [2025-03-08 06:36:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:06,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558781406] [2025-03-08 06:36:06,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:06,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:06,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 06:36:06,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 06:36:06,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:06,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-08 06:36:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558781406] [2025-03-08 06:36:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558781406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:36:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:36:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306026162] [2025-03-08 06:36:07,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:36:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:07,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:36:07,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:36:07,227 INFO L87 Difference]: Start difference. First operand 625 states and 955 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 06:36:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:07,541 INFO L93 Difference]: Finished difference Result 972 states and 1467 transitions. [2025-03-08 06:36:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:36:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2025-03-08 06:36:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:07,545 INFO L225 Difference]: With dead ends: 972 [2025-03-08 06:36:07,545 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 06:36:07,547 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-08 06:36:07,548 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 255 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:07,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 895 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:36:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 06:36:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 571. [2025-03-08 06:36:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 366 states have (on average 1.360655737704918) internal successors, (498), 368 states have internal predecessors, (498), 168 states have call successors, (168), 35 states have call predecessors, (168), 36 states have return successors, (188), 167 states have call predecessors, (188), 168 states have call successors, (188) [2025-03-08 06:36:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 854 transitions. [2025-03-08 06:36:07,578 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 854 transitions. Word has length 175 [2025-03-08 06:36:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 854 transitions. [2025-03-08 06:36:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 06:36:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 854 transitions. [2025-03-08 06:36:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 06:36:07,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:07,581 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-08 06:36:07,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:36:07,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2015088662, now seen corresponding path program 1 times [2025-03-08 06:36:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232688750] [2025-03-08 06:36:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 06:36:07,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 06:36:07,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:07,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-08 06:36:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232688750] [2025-03-08 06:36:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232688750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:36:08,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:36:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:36:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015696004] [2025-03-08 06:36:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:36:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:36:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:08,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:36:08,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:36:08,087 INFO L87 Difference]: Start difference. First operand 571 states and 854 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 06:36:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:08,537 INFO L93 Difference]: Finished difference Result 612 states and 903 transitions. [2025-03-08 06:36:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:36:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 190 [2025-03-08 06:36:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:08,541 INFO L225 Difference]: With dead ends: 612 [2025-03-08 06:36:08,541 INFO L226 Difference]: Without dead ends: 476 [2025-03-08 06:36:08,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:36:08,542 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 289 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:08,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1076 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:36:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-08 06:36:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 472. [2025-03-08 06:36:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 304 states have (on average 1.355263157894737) internal successors, (412), 305 states have internal predecessors, (412), 136 states have call successors, (136), 29 states have call predecessors, (136), 31 states have return successors, (154), 137 states have call predecessors, (154), 136 states have call successors, (154) [2025-03-08 06:36:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 702 transitions. [2025-03-08 06:36:08,567 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 702 transitions. Word has length 190 [2025-03-08 06:36:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:08,567 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 702 transitions. [2025-03-08 06:36:08,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 06:36:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 702 transitions. [2025-03-08 06:36:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 06:36:08,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:08,571 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:08,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:36:08,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 175334671, now seen corresponding path program 1 times [2025-03-08 06:36:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710290770] [2025-03-08 06:36:08,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:08,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 06:36:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 06:36:08,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-08 06:36:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710290770] [2025-03-08 06:36:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710290770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133745748] [2025-03-08 06:36:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:08,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:08,982 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-08 06:36:08,984 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-08 06:36:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 06:36:09,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 06:36:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:09,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:36:09,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-03-08 06:36:09,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-08 06:36:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133745748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:36:10,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:36:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:36:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143312247] [2025-03-08 06:36:10,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:10,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:36:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:10,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:36:10,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:36:10,089 INFO L87 Difference]: Start difference. First operand 472 states and 702 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-08 06:36:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:11,763 INFO L93 Difference]: Finished difference Result 1194 states and 1805 transitions. [2025-03-08 06:36:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:36:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 255 [2025-03-08 06:36:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:11,770 INFO L225 Difference]: With dead ends: 1194 [2025-03-08 06:36:11,770 INFO L226 Difference]: Without dead ends: 758 [2025-03-08 06:36:11,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 510 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-08 06:36:11,774 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 554 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:11,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 834 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:36:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-08 06:36:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 741. [2025-03-08 06:36:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 475 states have (on average 1.3789473684210527) internal successors, (655), 478 states have internal predecessors, (655), 212 states have call successors, (212), 51 states have call predecessors, (212), 53 states have return successors, (244), 211 states have call predecessors, (244), 212 states have call successors, (244) [2025-03-08 06:36:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1111 transitions. [2025-03-08 06:36:11,813 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1111 transitions. Word has length 255 [2025-03-08 06:36:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1111 transitions. [2025-03-08 06:36:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-08 06:36:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1111 transitions. [2025-03-08 06:36:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-08 06:36:11,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:11,820 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:11,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:36:12,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:12,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1136057649, now seen corresponding path program 1 times [2025-03-08 06:36:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145912293] [2025-03-08 06:36:12,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:12,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 06:36:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 06:36:12,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:12,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-08 06:36:13,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145912293] [2025-03-08 06:36:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145912293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855208412] [2025-03-08 06:36:13,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:13,553 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-08 06:36:13,555 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-08 06:36:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-08 06:36:14,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-08 06:36:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:14,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 06:36:14,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:14,280 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-08 06:36:19,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:36:19,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:36:19,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-08 06:36:20,666 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-08 06:36:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-08 06:36:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1031 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-08 06:36:36,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:36,425 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-08 06:36:36,429 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-08 06:36:36,802 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-08 06:36:36,805 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-08 06:36:36,848 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-08 06:36:36,850 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-08 06:36:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-08 06:36:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855208412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:36:37,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:36:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-03-08 06:36:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155838100] [2025-03-08 06:36:37,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 06:36:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:37,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 06:36:37,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1252, Unknown=2, NotChecked=0, Total=1406 [2025-03-08 06:36:37,040 INFO L87 Difference]: Start difference. First operand 741 states and 1111 transitions. Second operand has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2025-03-08 06:36:40,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:36:44,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:46,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:47,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:36:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:36:51,913 INFO L93 Difference]: Finished difference Result 1454 states and 2231 transitions. [2025-03-08 06:36:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 06:36:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) Word has length 255 [2025-03-08 06:36:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:36:51,920 INFO L225 Difference]: With dead ends: 1454 [2025-03-08 06:36:51,920 INFO L226 Difference]: Without dead ends: 835 [2025-03-08 06:36:51,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 487 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=685, Invalid=3603, Unknown=2, NotChecked=0, Total=4290 [2025-03-08 06:36:51,924 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1533 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 1273 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 4612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1273 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:36:51,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 2351 Invalid, 4612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1273 Valid, 3338 Invalid, 1 Unknown, 0 Unchecked, 13.4s Time] [2025-03-08 06:36:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-08 06:36:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 788. [2025-03-08 06:36:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 503 states have (on average 1.3757455268389662) internal successors, (692), 509 states have internal predecessors, (692), 226 states have call successors, (226), 51 states have call predecessors, (226), 58 states have return successors, (283), 227 states have call predecessors, (283), 226 states have call successors, (283) [2025-03-08 06:36:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1201 transitions. [2025-03-08 06:36:51,998 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1201 transitions. Word has length 255 [2025-03-08 06:36:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:36:51,998 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1201 transitions. [2025-03-08 06:36:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2025-03-08 06:36:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1201 transitions. [2025-03-08 06:36:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-08 06:36:52,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:36:52,006 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:36:52,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:36:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:52,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:36:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:36:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1579971836, now seen corresponding path program 1 times [2025-03-08 06:36:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:36:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000213767] [2025-03-08 06:36:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:36:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-08 06:36:52,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-08 06:36:52,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:52,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2025-03-08 06:36:53,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:36:53,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000213767] [2025-03-08 06:36:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000213767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448946574] [2025-03-08 06:36:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:36:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:36:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:36:53,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:36:53,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:36:54,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-08 06:36:54,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-08 06:36:54,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:36:54,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:36:54,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 06:36:54,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:36:54,601 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 23 treesize of output 1 [2025-03-08 06:37:00,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:37:00,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:37:00,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-03-08 06:37:00,414 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-03-08 06:37:00,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 122 [2025-03-08 06:37:00,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:37:00,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2025-03-08 06:37:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 1065 proven. 242 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2025-03-08 06:37:01,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:37:01,220 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 28 treesize of output 26 [2025-03-08 06:37:01,223 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 142 treesize of output 134 [2025-03-08 06:37:01,557 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 21 treesize of output 19 [2025-03-08 06:37:01,559 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 30 treesize of output 26 [2025-03-08 06:37:01,620 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 21 treesize of output 19 [2025-03-08 06:37:01,622 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 30 treesize of output 26 [2025-03-08 06:37:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2025-03-08 06:37:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448946574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:37:01,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:37:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 14] total 36 [2025-03-08 06:37:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355001898] [2025-03-08 06:37:01,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:37:01,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 06:37:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:37:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 06:37:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1110, Unknown=2, NotChecked=0, Total=1260 [2025-03-08 06:37:01,824 INFO L87 Difference]: Start difference. First operand 788 states and 1201 transitions. Second operand has 36 states, 32 states have (on average 5.34375) internal successors, (171), 34 states have internal predecessors, (171), 20 states have call successors, (73), 11 states have call predecessors, (73), 14 states have return successors, (73), 17 states have call predecessors, (73), 20 states have call successors, (73) [2025-03-08 06:37:04,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:37:08,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:37:12,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:37:17,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:37:19,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 06:37:24,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]