./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_queue-1.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 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:23:34,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:23:34,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:23:34,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:23:34,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:23:34,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:23:34,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:23:34,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:23:34,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:23:34,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:23:34,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:23:34,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:23:34,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:23:34,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:23:34,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:23:34,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:23:34,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:23:34,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:23:34,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:23:34,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:34,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:23:34,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:23:34,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:23:34,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:23:34,304 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 -> 38d92478d67c3996e3815aaa6d0075347cfc456da7f20d1b1bb733d11593b6cf [2025-03-03 15:23:34,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:23:34,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:23:34,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:23:34,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:23:34,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:23:34,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-03-03 15:23:35,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3fca3a5/90368b2aae4249359ed92286fb5df5a0/FLAG609dbd2cf [2025-03-03 15:23:36,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:23:36,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-1.i [2025-03-03 15:23:36,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3fca3a5/90368b2aae4249359ed92286fb5df5a0/FLAG609dbd2cf [2025-03-03 15:23:36,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3fca3a5/90368b2aae4249359ed92286fb5df5a0 [2025-03-03 15:23:36,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:23:36,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:23:36,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:36,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:23:36,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:23:36,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a627d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36, skipping insertion in model container [2025-03-03 15:23:36,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:23:36,592 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_queue-1.i[34744,34757] [2025-03-03 15:23:36,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:36,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:23:36,763 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_queue-1.i[34744,34757] [2025-03-03 15:23:36,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:36,877 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:23:36,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36 WrapperNode [2025-03-03 15:23:36,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:36,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:36,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:23:36,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:23:36,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,965 INFO L138 Inliner]: procedures = 251, calls = 629, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1399 [2025-03-03 15:23:36,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:36,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:23:36,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:23:36,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:23:36,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:36,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,033 INFO L175 MemorySlicer]: Split 397 memory accesses to 20 slices as follows [2, 8, 8, 113, 3, 8, 20, 3, 41, 12, 82, 8, 0, 8, 6, 3, 7, 50, 7, 8]. 28 percent of accesses are in the largest equivalence class. The 117 initializations are split as follows [2, 3, 3, 46, 0, 3, 6, 0, 0, 6, 40, 2, 0, 2, 2, 0, 0, 0, 0, 2]. The 94 writes are split as follows [0, 2, 2, 33, 1, 2, 8, 1, 1, 3, 21, 4, 0, 4, 2, 1, 1, 4, 1, 3]. [2025-03-03 15:23:37,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:23:37,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:23:37,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:23:37,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:23:37,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (1/1) ... [2025-03-03 15:23:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:37,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:23:37,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:23:37,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2025-03-03 15:23:37,207 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-03 15:23:37,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:23:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-03 15:23:37,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:23:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:23:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 15:23:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 15:23:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:23:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:23:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 15:23:37,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:23:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:23:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:23:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:23:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 15:23:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:23:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:23:37,497 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:23:37,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:23:37,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-03 15:23:37,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:23:37,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L976-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:37,565 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-03 15:23:37,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L971: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:23:37,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L971-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-03 15:23:38,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-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-03 15:23:38,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-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-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-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-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);enqueue_#res#1 := 0; [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-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-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1015-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2025-03-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-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-03 15:23:38,016 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-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-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-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-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-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-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-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-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1108-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-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-03 15:23:38,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:42,527 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-03 15:23:42,527 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:23:42,544 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:23:42,545 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:23:42,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:42 BoogieIcfgContainer [2025-03-03 15:23:42,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:23:42,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:23:42,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:23:42,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:23:42,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:23:36" (1/3) ... [2025-03-03 15:23:42,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761e1325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:42, skipping insertion in model container [2025-03-03 15:23:42,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:36" (2/3) ... [2025-03-03 15:23:42,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761e1325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:42, skipping insertion in model container [2025-03-03 15:23:42,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:42" (3/3) ... [2025-03-03 15:23:42,551 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_queue-1.i [2025-03-03 15:23:42,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:23:42,562 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_queue-1.i that has 10 procedures, 336 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-03 15:23:42,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:23:42,611 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;@30bc8ce6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:23:42,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:23:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 15:23:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 15:23:42,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:42,636 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:42,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:42,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1287243078, now seen corresponding path program 1 times [2025-03-03 15:23:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:42,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051540944] [2025-03-03 15:23:42,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:43,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 15:23:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 15:23:43,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-03 15:23:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051540944] [2025-03-03 15:23:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051540944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:43,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:43,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102309962] [2025-03-03 15:23:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:43,874 INFO L87 Difference]: Start difference. First operand has 336 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 195 states have internal predecessors, (283), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:47,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:48,035 INFO L93 Difference]: Finished difference Result 667 states and 1212 transitions. [2025-03-03 15:23:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 325 [2025-03-03 15:23:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:48,044 INFO L225 Difference]: With dead ends: 667 [2025-03-03 15:23:48,044 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 15:23:48,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:48,065 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 6 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:48,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1065 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 15:23:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 15:23:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-03-03 15:23:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 189 states have (on average 1.4550264550264551) internal successors, (275), 191 states have internal predecessors, (275), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 15:23:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 536 transitions. [2025-03-03 15:23:48,129 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 536 transitions. Word has length 325 [2025-03-03 15:23:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:48,129 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 536 transitions. [2025-03-03 15:23:48,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 536 transitions. [2025-03-03 15:23:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 15:23:48,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:48,138 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:23:48,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash 839483146, now seen corresponding path program 1 times [2025-03-03 15:23:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300555221] [2025-03-03 15:23:48,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:48,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 15:23:48,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 15:23:48,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:48,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-03 15:23:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300555221] [2025-03-03 15:23:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300555221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303489040] [2025-03-03 15:23:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:48,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:48,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:48,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:48,733 INFO L87 Difference]: Start difference. First operand 330 states and 536 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:48,786 INFO L93 Difference]: Finished difference Result 660 states and 1075 transitions. [2025-03-03 15:23:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:48,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 329 [2025-03-03 15:23:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:48,793 INFO L225 Difference]: With dead ends: 660 [2025-03-03 15:23:48,795 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 15:23:48,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:48,800 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:48,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1059 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 15:23:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 15:23:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 192 states have (on average 1.4479166666666667) internal successors, (278), 194 states have internal predecessors, (278), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 15:23:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 539 transitions. [2025-03-03 15:23:48,837 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 539 transitions. Word has length 329 [2025-03-03 15:23:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:48,837 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 539 transitions. [2025-03-03 15:23:48,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 539 transitions. [2025-03-03 15:23:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 15:23:48,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:48,844 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:48,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:23:48,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:48,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -878384287, now seen corresponding path program 1 times [2025-03-03 15:23:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:48,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894442470] [2025-03-03 15:23:48,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:48,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:49,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 15:23:49,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 15:23:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-03 15:23:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894442470] [2025-03-03 15:23:49,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894442470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83889075] [2025-03-03 15:23:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:49,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:23:49,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:23:50,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 15:23:50,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 15:23:50,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:50,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:50,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:50,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-03 15:23:50,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5308 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2025-03-03 15:23:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83889075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:50,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 15:23:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8772482] [2025-03-03 15:23:50,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:23:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:50,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:23:50,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:50,953 INFO L87 Difference]: Start difference. First operand 333 states and 539 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 15:23:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:51,072 INFO L93 Difference]: Finished difference Result 670 states and 1089 transitions. [2025-03-03 15:23:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:23:51,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 332 [2025-03-03 15:23:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:51,078 INFO L225 Difference]: With dead ends: 670 [2025-03-03 15:23:51,078 INFO L226 Difference]: Without dead ends: 340 [2025-03-03 15:23:51,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:51,083 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:51,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:23:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-03 15:23:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-03 15:23:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 201 states have internal predecessors, (285), 131 states have call successors, (131), 9 states have call predecessors, (131), 9 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-03 15:23:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 546 transitions. [2025-03-03 15:23:51,112 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 546 transitions. Word has length 332 [2025-03-03 15:23:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 546 transitions. [2025-03-03 15:23:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 1 states have call successors, (105), 2 states have call predecessors, (105), 2 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 15:23:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 546 transitions. [2025-03-03 15:23:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 15:23:51,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:51,117 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:51,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:23:51,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:51,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:51,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1785173654, now seen corresponding path program 2 times [2025-03-03 15:23:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:51,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867417170] [2025-03-03 15:23:51,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:51,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 339 statements into 2 equivalence classes. [2025-03-03 15:23:51,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 339 statements. [2025-03-03 15:23:51,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5328 trivial. 0 not checked. [2025-03-03 15:23:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867417170] [2025-03-03 15:23:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867417170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:23:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993631716] [2025-03-03 15:23:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:23:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:52,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:23:52,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:23:52,097 INFO L87 Difference]: Start difference. First operand 340 states and 546 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:52,364 INFO L93 Difference]: Finished difference Result 667 states and 1079 transitions. [2025-03-03 15:23:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 339 [2025-03-03 15:23:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:52,373 INFO L225 Difference]: With dead ends: 667 [2025-03-03 15:23:52,374 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 15:23:52,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:52,375 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 416 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:52,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 2146 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:23:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 15:23:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2025-03-03 15:23:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 381 states have (on average 1.4383202099737533) internal successors, (548), 384 states have internal predecessors, (548), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-03 15:23:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1075 transitions. [2025-03-03 15:23:52,437 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1075 transitions. Word has length 339 [2025-03-03 15:23:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:52,439 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1075 transitions. [2025-03-03 15:23:52,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-03 15:23:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1075 transitions. [2025-03-03 15:23:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 15:23:52,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:52,445 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:23:52,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:23:52,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682201, now seen corresponding path program 1 times [2025-03-03 15:23:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004298056] [2025-03-03 15:23:52,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:52,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 15:23:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 15:23:52,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5327 trivial. 0 not checked. [2025-03-03 15:23:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004298056] [2025-03-03 15:23:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004298056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809939019] [2025-03-03 15:23:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:53,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:23:53,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:23:53,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 15:23:53,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 15:23:53,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:53,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 2226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:23:53,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5319 trivial. 0 not checked. [2025-03-03 15:23:54,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5330 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2025-03-03 15:23:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809939019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:54,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 15:23:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393111043] [2025-03-03 15:23:54,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:54,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:23:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:54,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:23:54,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:23:54,577 INFO L87 Difference]: Start difference. First operand 662 states and 1075 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 15:23:59,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:03,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:03,511 INFO L93 Difference]: Finished difference Result 1361 states and 2217 transitions. [2025-03-03 15:24:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:24:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 344 [2025-03-03 15:24:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:03,518 INFO L225 Difference]: With dead ends: 1361 [2025-03-03 15:24:03,518 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 15:24:03,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 678 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:24:03,522 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 29 mSDsluCounter, 3162 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:03,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3691 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 46 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-03 15:24:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 15:24:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-03 15:24:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4038004750593824) internal successors, (591), 424 states have internal predecessors, (591), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-03 15:24:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1118 transitions. [2025-03-03 15:24:03,567 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1118 transitions. Word has length 344 [2025-03-03 15:24:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:03,567 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1118 transitions. [2025-03-03 15:24:03,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 1 states have call successors, (107), 2 states have call predecessors, (107), 2 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 15:24:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1118 transitions. [2025-03-03 15:24:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-03 15:24:03,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:03,575 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 20, 20, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:03,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:24:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:03,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 495526237, now seen corresponding path program 2 times [2025-03-03 15:24:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362829261] [2025-03-03 15:24:03,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:04,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-03-03 15:24:04,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 384 statements. [2025-03-03 15:24:04,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5797 trivial. 0 not checked. [2025-03-03 15:24:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362829261] [2025-03-03 15:24:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362829261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879485583] [2025-03-03 15:24:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:04,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:04,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:04,423 INFO L87 Difference]: Start difference. First operand 702 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 15:24:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:04,460 INFO L93 Difference]: Finished difference Result 1338 states and 2156 transitions. [2025-03-03 15:24:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 384 [2025-03-03 15:24:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:04,467 INFO L225 Difference]: With dead ends: 1338 [2025-03-03 15:24:04,467 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 15:24:04,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:04,470 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:04,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1064 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 15:24:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-03 15:24:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 421 states have (on average 1.4014251781472684) internal successors, (590), 424 states have internal predecessors, (590), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-03 15:24:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1117 transitions. [2025-03-03 15:24:04,534 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1117 transitions. Word has length 384 [2025-03-03 15:24:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1117 transitions. [2025-03-03 15:24:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2025-03-03 15:24:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1117 transitions. [2025-03-03 15:24:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-03 15:24:04,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:04,542 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 20, 20, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:04,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 662805287, now seen corresponding path program 1 times [2025-03-03 15:24:04,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235802947] [2025-03-03 15:24:04,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-03 15:24:05,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-03 15:24:05,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:05,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-03 15:24:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235802947] [2025-03-03 15:24:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235802947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013302972] [2025-03-03 15:24:05,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:05,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:05,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:05,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:24:06,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-03 15:24:06,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-03 15:24:06,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:06,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:06,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:07,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2025-03-03 15:24:07,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6007 backedges. 125 proven. 55 refuted. 0 times theorem prover too weak. 5827 trivial. 0 not checked. [2025-03-03 15:24:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013302972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:07,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-03 15:24:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009722372] [2025-03-03 15:24:07,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:07,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:24:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:07,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:24:07,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:24:07,954 INFO L87 Difference]: Start difference. First operand 702 states and 1117 transitions. Second operand has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-03 15:24:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:08,226 INFO L93 Difference]: Finished difference Result 1430 states and 2299 transitions. [2025-03-03 15:24:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:24:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 404 [2025-03-03 15:24:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:08,233 INFO L225 Difference]: With dead ends: 1430 [2025-03-03 15:24:08,234 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 15:24:08,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 796 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:24:08,238 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:08,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2634 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:24:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 15:24:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-03 15:24:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 461 states have (on average 1.3665943600867678) internal successors, (630), 464 states have internal predecessors, (630), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (266), 260 states have call predecessors, (266), 259 states have call successors, (266) [2025-03-03 15:24:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1157 transitions. [2025-03-03 15:24:08,276 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1157 transitions. Word has length 404 [2025-03-03 15:24:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:08,277 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1157 transitions. [2025-03-03 15:24:08,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.521739130434782) internal successors, (127), 23 states have internal predecessors, (127), 2 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-03 15:24:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1157 transitions. [2025-03-03 15:24:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-03 15:24:08,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:08,284 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:08,296 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-03 15:24:08,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:08,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:08,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2058133118, now seen corresponding path program 1 times [2025-03-03 15:24:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:08,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569841343] [2025-03-03 15:24:08,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-03 15:24:09,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-03 15:24:09,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:09,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7265 trivial. 0 not checked. [2025-03-03 15:24:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569841343] [2025-03-03 15:24:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569841343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484529231] [2025-03-03 15:24:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:10,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:10,291 INFO L87 Difference]: Start difference. First operand 742 states and 1157 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-03 15:24:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:11,637 INFO L93 Difference]: Finished difference Result 774 states and 1200 transitions. [2025-03-03 15:24:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 445 [2025-03-03 15:24:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:11,643 INFO L225 Difference]: With dead ends: 774 [2025-03-03 15:24:11,643 INFO L226 Difference]: Without dead ends: 772 [2025-03-03 15:24:11,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:11,644 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 788 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:11,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1948 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:24:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-03 15:24:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 769. [2025-03-03 15:24:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 479 states have (on average 1.361169102296451) internal successors, (652), 482 states have internal predecessors, (652), 266 states have call successors, (266), 20 states have call predecessors, (266), 23 states have return successors, (278), 268 states have call predecessors, (278), 264 states have call successors, (278) [2025-03-03 15:24:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1196 transitions. [2025-03-03 15:24:11,680 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1196 transitions. Word has length 445 [2025-03-03 15:24:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1196 transitions. [2025-03-03 15:24:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (57), 3 states have call predecessors, (57), 2 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-03 15:24:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1196 transitions. [2025-03-03 15:24:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 15:24:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:11,686 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:11,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:24:11,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1358281581, now seen corresponding path program 1 times [2025-03-03 15:24:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663453971] [2025-03-03 15:24:11,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:11,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-03 15:24:12,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-03 15:24:12,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:12,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-03-03 15:24:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663453971] [2025-03-03 15:24:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663453971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:13,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136510887] [2025-03-03 15:24:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:13,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:13,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:13,065 INFO L87 Difference]: Start difference. First operand 769 states and 1196 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:17,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:21,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:25,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:25,559 INFO L93 Difference]: Finished difference Result 2127 states and 3416 transitions. [2025-03-03 15:24:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) Word has length 450 [2025-03-03 15:24:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:25,569 INFO L225 Difference]: With dead ends: 2127 [2025-03-03 15:24:25,570 INFO L226 Difference]: Without dead ends: 1457 [2025-03-03 15:24:25,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:25,574 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 612 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:25,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2096 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-03-03 15:24:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-03 15:24:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 775. [2025-03-03 15:24:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 483 states have (on average 1.3581780538302277) internal successors, (656), 488 states have internal predecessors, (656), 266 states have call successors, (266), 20 states have call predecessors, (266), 25 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1206 transitions. [2025-03-03 15:24:25,649 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1206 transitions. Word has length 450 [2025-03-03 15:24:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:25,649 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1206 transitions. [2025-03-03 15:24:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1206 transitions. [2025-03-03 15:24:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 15:24:25,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:25,654 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:24:25,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 756044741, now seen corresponding path program 1 times [2025-03-03 15:24:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911140137] [2025-03-03 15:24:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:25,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-03 15:24:26,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-03 15:24:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:26,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-03-03 15:24:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911140137] [2025-03-03 15:24:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911140137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753160839] [2025-03-03 15:24:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:27,218 INFO L87 Difference]: Start difference. First operand 775 states and 1206 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:31,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:35,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:36,809 INFO L93 Difference]: Finished difference Result 2145 states and 3446 transitions. [2025-03-03 15:24:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:36,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) Word has length 450 [2025-03-03 15:24:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:36,822 INFO L225 Difference]: With dead ends: 2145 [2025-03-03 15:24:36,822 INFO L226 Difference]: Without dead ends: 1469 [2025-03-03 15:24:36,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:36,827 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 684 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:36,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1674 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2025-03-03 15:24:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-03-03 15:24:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 775. [2025-03-03 15:24:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 483 states have (on average 1.3581780538302277) internal successors, (656), 488 states have internal predecessors, (656), 266 states have call successors, (266), 20 states have call predecessors, (266), 25 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1206 transitions. [2025-03-03 15:24:36,938 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1206 transitions. Word has length 450 [2025-03-03 15:24:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:36,939 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1206 transitions. [2025-03-03 15:24:36,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1206 transitions. [2025-03-03 15:24:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 15:24:36,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:36,946 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:36,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:24:36,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:36,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 201309244, now seen corresponding path program 1 times [2025-03-03 15:24:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580206522] [2025-03-03 15:24:36,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:37,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 15:24:37,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 15:24:37,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:37,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7273 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7269 trivial. 0 not checked. [2025-03-03 15:24:38,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:38,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580206522] [2025-03-03 15:24:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580206522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:38,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:24:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763190100] [2025-03-03 15:24:38,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:24:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:38,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:24:38,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:38,485 INFO L87 Difference]: Start difference. First operand 775 states and 1206 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:40,086 INFO L93 Difference]: Finished difference Result 784 states and 1213 transitions. [2025-03-03 15:24:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:40,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) Word has length 449 [2025-03-03 15:24:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:40,092 INFO L225 Difference]: With dead ends: 784 [2025-03-03 15:24:40,093 INFO L226 Difference]: Without dead ends: 782 [2025-03-03 15:24:40,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:40,093 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 710 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:40,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2346 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:24:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-03 15:24:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 779. [2025-03-03 15:24:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 486 states have (on average 1.3559670781893005) internal successors, (659), 491 states have internal predecessors, (659), 266 states have call successors, (266), 21 states have call predecessors, (266), 26 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2025-03-03 15:24:40,149 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 449 [2025-03-03 15:24:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:40,150 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2025-03-03 15:24:40,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (57), 3 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-03 15:24:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2025-03-03 15:24:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 15:24:40,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:40,155 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:24:40,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 943916295, now seen corresponding path program 1 times [2025-03-03 15:24:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548468263] [2025-03-03 15:24:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:40,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 15:24:40,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 15:24:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7283 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7277 trivial. 0 not checked. [2025-03-03 15:24:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548468263] [2025-03-03 15:24:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548468263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:41,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726113938] [2025-03-03 15:24:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:41,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:41,745 INFO L87 Difference]: Start difference. First operand 779 states and 1209 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-03 15:24:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:42,825 INFO L93 Difference]: Finished difference Result 788 states and 1216 transitions. [2025-03-03 15:24:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 454 [2025-03-03 15:24:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:42,832 INFO L225 Difference]: With dead ends: 788 [2025-03-03 15:24:42,832 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 15:24:42,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:42,833 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 595 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:42,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2041 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:24:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 15:24:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 783. [2025-03-03 15:24:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 489 states have (on average 1.3537832310838447) internal successors, (662), 494 states have internal predecessors, (662), 266 states have call successors, (266), 22 states have call predecessors, (266), 27 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1212 transitions. [2025-03-03 15:24:42,889 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1212 transitions. Word has length 454 [2025-03-03 15:24:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1212 transitions. [2025-03-03 15:24:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (59), 3 states have call predecessors, (59), 2 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-03 15:24:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1212 transitions. [2025-03-03 15:24:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 15:24:42,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:42,895 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:42,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:24:42,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:42,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1964469084, now seen corresponding path program 1 times [2025-03-03 15:24:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171824486] [2025-03-03 15:24:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 15:24:43,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 15:24:43,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:43,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7297 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7289 trivial. 0 not checked. [2025-03-03 15:24:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171824486] [2025-03-03 15:24:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171824486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368178399] [2025-03-03 15:24:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:44,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:44,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:44,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:44,244 INFO L87 Difference]: Start difference. First operand 783 states and 1212 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-03 15:24:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:45,361 INFO L93 Difference]: Finished difference Result 792 states and 1219 transitions. [2025-03-03 15:24:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 459 [2025-03-03 15:24:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:45,366 INFO L225 Difference]: With dead ends: 792 [2025-03-03 15:24:45,366 INFO L226 Difference]: Without dead ends: 790 [2025-03-03 15:24:45,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:45,367 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 787 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:45,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1955 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:24:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-03 15:24:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 787. [2025-03-03 15:24:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 492 states have (on average 1.3516260162601625) internal successors, (665), 497 states have internal predecessors, (665), 266 states have call successors, (266), 23 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1215 transitions. [2025-03-03 15:24:45,418 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1215 transitions. Word has length 459 [2025-03-03 15:24:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:45,419 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1215 transitions. [2025-03-03 15:24:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (60), 3 states have call predecessors, (60), 2 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-03 15:24:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1215 transitions. [2025-03-03 15:24:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-03 15:24:45,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:45,423 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:24:45,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:45,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1140745625, now seen corresponding path program 1 times [2025-03-03 15:24:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086350570] [2025-03-03 15:24:45,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:45,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-03 15:24:45,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-03 15:24:45,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:45,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7305 trivial. 0 not checked. [2025-03-03 15:24:46,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:46,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086350570] [2025-03-03 15:24:46,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086350570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:46,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:46,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:24:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94294910] [2025-03-03 15:24:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:46,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:24:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:46,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:24:46,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:46,817 INFO L87 Difference]: Start difference. First operand 787 states and 1215 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-03 15:24:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:48,413 INFO L93 Difference]: Finished difference Result 796 states and 1222 transitions. [2025-03-03 15:24:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) Word has length 464 [2025-03-03 15:24:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:48,418 INFO L225 Difference]: With dead ends: 796 [2025-03-03 15:24:48,418 INFO L226 Difference]: Without dead ends: 792 [2025-03-03 15:24:48,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:48,419 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 710 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:48,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2346 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:24:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-03 15:24:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 789. [2025-03-03 15:24:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 494 states have (on average 1.3481781376518218) internal successors, (666), 498 states have internal predecessors, (666), 266 states have call successors, (266), 24 states have call predecessors, (266), 28 states have return successors, (284), 268 states have call predecessors, (284), 264 states have call successors, (284) [2025-03-03 15:24:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1216 transitions. [2025-03-03 15:24:48,472 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1216 transitions. Word has length 464 [2025-03-03 15:24:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1216 transitions. [2025-03-03 15:24:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (61), 3 states have call predecessors, (61), 2 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-03 15:24:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1216 transitions. [2025-03-03 15:24:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 15:24:48,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:48,477 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 40, 40, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:48,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:24:48,477 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2110063228, now seen corresponding path program 1 times [2025-03-03 15:24:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479825806] [2025-03-03 15:24:48,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:48,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 15:24:48,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 15:24:48,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:48,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7337 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7325 trivial. 0 not checked. [2025-03-03 15:24:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479825806] [2025-03-03 15:24:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479825806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:24:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029397576] [2025-03-03 15:24:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:49,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:49,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:49,621 INFO L87 Difference]: Start difference. First operand 789 states and 1216 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-03 15:24:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:50,658 INFO L93 Difference]: Finished difference Result 792 states and 1218 transitions. [2025-03-03 15:24:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:50,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 469 [2025-03-03 15:24:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:50,663 INFO L225 Difference]: With dead ends: 792 [2025-03-03 15:24:50,663 INFO L226 Difference]: Without dead ends: 650 [2025-03-03 15:24:50,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:24:50,664 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 780 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:50,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1979 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:24:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-03 15:24:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2025-03-03 15:24:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 419 states have (on average 1.405727923627685) internal successors, (589), 424 states have internal predecessors, (589), 207 states have call successors, (207), 17 states have call predecessors, (207), 22 states have return successors, (224), 209 states have call predecessors, (224), 206 states have call successors, (224) [2025-03-03 15:24:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1020 transitions. [2025-03-03 15:24:50,709 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1020 transitions. Word has length 469 [2025-03-03 15:24:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:50,709 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1020 transitions. [2025-03-03 15:24:50,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-03 15:24:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1020 transitions. [2025-03-03 15:24:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-03 15:24:50,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:50,713 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 40, 40, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:24:50,714 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1611683192, now seen corresponding path program 1 times [2025-03-03 15:24:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584287564] [2025-03-03 15:24:50,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:51,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-03 15:24:51,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-03 15:24:51,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-03-03 15:24:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584287564] [2025-03-03 15:24:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584287564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943008148] [2025-03-03 15:24:52,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:52,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:52,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:52,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:24:53,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-03 15:24:53,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-03 15:24:53,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:53,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:53,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 4183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:53,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:54,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-03 15:24:54,184 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 9 treesize of output 3 [2025-03-03 15:24:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 1040 proven. 5 refuted. 0 times theorem prover too weak. 7147 trivial. 0 not checked. [2025-03-03 15:24:54,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8187 trivial. 0 not checked. [2025-03-03 15:24:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943008148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:55,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-03 15:24:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462690953] [2025-03-03 15:24:55,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:24:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:55,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:24:55,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:24:55,815 INFO L87 Difference]: Start difference. First operand 649 states and 1020 transitions. Second operand has 9 states, 7 states have (on average 18.857142857142858) internal successors, (132), 9 states have internal predecessors, (132), 9 states have call successors, (118), 4 states have call predecessors, (118), 5 states have return successors, (117), 7 states have call predecessors, (117), 9 states have call successors, (117) [2025-03-03 15:24:59,866 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 []