./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c --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-mthreaded/rekh_ctm.1.c -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 c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:58:50,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:58:50,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:58:50,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:58:50,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:58:50,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:58:50,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:58:50,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:58:50,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:58:50,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:58:50,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:58:50,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:58:50,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:58:50,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:58:50,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:58:50,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:58:50,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:58:50,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:58:50,776 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 -> c3ec7c03a28dc415c6db5fadbfd8dcd491b1a493cd1bf88ef12d02131cd13437 [2025-03-03 14:58:51,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:58:51,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:58:51,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:58:51,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:58:51,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:58:51,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-03-03 14:58:52,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5aada78/8310e1a094404fe996c7a55752a80eb1/FLAG75940d3c5 [2025-03-03 14:58:52,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:58:52,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.1.c [2025-03-03 14:58:52,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5aada78/8310e1a094404fe996c7a55752a80eb1/FLAG75940d3c5 [2025-03-03 14:58:52,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5aada78/8310e1a094404fe996c7a55752a80eb1 [2025-03-03 14:58:52,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:58:52,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:58:52,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:58:52,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:58:52,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:58:52,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:58:52" (1/1) ... [2025-03-03 14:58:52,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd3bdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:52, skipping insertion in model container [2025-03-03 14:58:52,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:58:52" (1/1) ... [2025-03-03 14:58:52,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:58:52,931 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-mthreaded/rekh_ctm.1.c[1868,1881] [2025-03-03 14:58:53,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:58:53,271 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:58:53,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok1.i","-S") [42] [2025-03-03 14:58:53,281 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-mthreaded/rekh_ctm.1.c[1868,1881] [2025-03-03 14:58:53,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:58:53,513 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:58:53,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53 WrapperNode [2025-03-03 14:58:53,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:58:53,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:58:53,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:58:53,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:58:53,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,745 INFO L138 Inliner]: procedures = 99, calls = 2727, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8497 [2025-03-03 14:58:53,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:58:53,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:58:53,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:58:53,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:58:53,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,862 INFO L175 MemorySlicer]: Split 2332 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 402 writes are split as follows [0, 7, 7, 7, 7, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6]. [2025-03-03 14:58:53,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:53,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:54,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:54,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:58:54,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:58:54,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:58:54,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:58:54,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (1/1) ... [2025-03-03 14:58:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:58:54,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:58:54,125 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 14:58:54,127 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 14:58:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-03-03 14:58:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-03-03 14:58:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-03-03 14:58:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-03-03 14:58:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:58:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 14:58:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-03 14:58:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-03 14:58:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-03 14:58:54,151 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-03 14:58:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:58:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-03 14:58:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:58:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-03-03 14:58:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-03-03 14:58:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-03-03 14:58:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-03-03 14:58:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-03-03 14:58:54,154 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-03-03 14:58:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-03-03 14:58:54,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-03-03 14:58:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-03 14:58:54,154 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-03 14:58:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-03-03 14:58:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-03-03 14:58:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:58:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:58:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:58:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:58:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-03-03 14:58:54,163 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-03-03 14:58:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-03-03 14:58:54,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:58:54,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:58:54,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:58:54,687 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:59:03,827 INFO L? ?]: Removed 947 outVars from TransFormulas that were not future-live. [2025-03-03 14:59:03,827 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:59:03,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:59:03,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:59:03,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:03 BoogieIcfgContainer [2025-03-03 14:59:03,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:59:03,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:59:03,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:59:03,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:59:03,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:58:52" (1/3) ... [2025-03-03 14:59:03,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e63dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:03, skipping insertion in model container [2025-03-03 14:59:03,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:58:53" (2/3) ... [2025-03-03 14:59:03,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e63dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:03, skipping insertion in model container [2025-03-03 14:59:03,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:03" (3/3) ... [2025-03-03 14:59:03,879 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.1.c [2025-03-03 14:59:03,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:59:03,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.1.c that has 45 procedures, 2464 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:59:03,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:59:03,997 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;@12a6b2fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:59:03,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:59:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-03-03 14:59:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:59:04,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:04,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:04,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1014247921, now seen corresponding path program 1 times [2025-03-03 14:59:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337050832] [2025-03-03 14:59:04,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:59:04,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:59:04,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:04,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:59:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337050832] [2025-03-03 14:59:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337050832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:05,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:59:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855360062] [2025-03-03 14:59:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:59:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:05,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:59:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:05,124 INFO L87 Difference]: Start difference. First operand has 2464 states, 2113 states have (on average 1.480832938949361) internal successors, (3129), 2137 states have internal predecessors, (3129), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:59:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:05,319 INFO L93 Difference]: Finished difference Result 4919 states and 7725 transitions. [2025-03-03 14:59:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:59:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-03-03 14:59:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:05,353 INFO L225 Difference]: With dead ends: 4919 [2025-03-03 14:59:05,353 INFO L226 Difference]: Without dead ends: 2451 [2025-03-03 14:59:05,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:05,382 INFO L435 NwaCegarLoop]: 3043 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:05,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:59:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-03 14:59:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2025-03-03 14:59:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2101 states have (on average 1.15421227986673) internal successors, (2425), 2125 states have internal predecessors, (2425), 305 states have call successors, (305), 44 states have call predecessors, (305), 44 states have return successors, (304), 294 states have call predecessors, (304), 304 states have call successors, (304) [2025-03-03 14:59:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3034 transitions. [2025-03-03 14:59:05,578 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3034 transitions. Word has length 148 [2025-03-03 14:59:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:05,579 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3034 transitions. [2025-03-03 14:59:05,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:59:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3034 transitions. [2025-03-03 14:59:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:05,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:05,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:05,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:59:05,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:05,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash -658867522, now seen corresponding path program 1 times [2025-03-03 14:59:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681427453] [2025-03-03 14:59:05,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:06,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:06,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:06,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681427453] [2025-03-03 14:59:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681427453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807306490] [2025-03-03 14:59:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:06,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:06,972 INFO L87 Difference]: Start difference. First operand 2451 states and 3034 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:10,164 INFO L93 Difference]: Finished difference Result 5556 states and 6977 transitions. [2025-03-03 14:59:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-03-03 14:59:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:10,180 INFO L225 Difference]: With dead ends: 5556 [2025-03-03 14:59:10,180 INFO L226 Difference]: Without dead ends: 3110 [2025-03-03 14:59:10,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:10,195 INFO L435 NwaCegarLoop]: 3648 mSDtfsCounter, 5820 mSDsluCounter, 4602 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5820 SdHoareTripleChecker+Valid, 8250 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:10,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5820 Valid, 8250 Invalid, 2541 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [487 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 14:59:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-03-03 14:59:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2974. [2025-03-03 14:59:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2476 states have (on average 1.186995153473344) internal successors, (2939), 2506 states have internal predecessors, (2939), 420 states have call successors, (420), 77 states have call predecessors, (420), 77 states have return successors, (419), 405 states have call predecessors, (419), 419 states have call successors, (419) [2025-03-03 14:59:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3778 transitions. [2025-03-03 14:59:10,294 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3778 transitions. Word has length 208 [2025-03-03 14:59:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:10,294 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 3778 transitions. [2025-03-03 14:59:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3778 transitions. [2025-03-03 14:59:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 14:59:10,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:10,300 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:59:10,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:10,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 183596080, now seen corresponding path program 1 times [2025-03-03 14:59:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459078585] [2025-03-03 14:59:10,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:10,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 14:59:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 14:59:10,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:59:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:12,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459078585] [2025-03-03 14:59:12,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459078585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:12,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:59:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215627501] [2025-03-03 14:59:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:12,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:59:12,309 INFO L87 Difference]: Start difference. First operand 2974 states and 3778 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:59:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:14,529 INFO L93 Difference]: Finished difference Result 6329 states and 8111 transitions. [2025-03-03 14:59:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-03-03 14:59:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:14,545 INFO L225 Difference]: With dead ends: 6329 [2025-03-03 14:59:14,545 INFO L226 Difference]: Without dead ends: 3360 [2025-03-03 14:59:14,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:14,557 INFO L435 NwaCegarLoop]: 3423 mSDtfsCounter, 3669 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 6772 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:14,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3669 Valid, 6772 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:59:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2025-03-03 14:59:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2025-03-03 14:59:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 2758 states have (on average 1.207396664249456) internal successors, (3330), 2797 states have internal predecessors, (3330), 501 states have call successors, (501), 98 states have call predecessors, (501), 98 states have return successors, (500), 482 states have call predecessors, (500), 500 states have call successors, (500) [2025-03-03 14:59:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4331 transitions. [2025-03-03 14:59:14,660 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4331 transitions. Word has length 205 [2025-03-03 14:59:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:14,661 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 4331 transitions. [2025-03-03 14:59:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:59:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4331 transitions. [2025-03-03 14:59:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:14,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:14,668 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:14,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:59:14,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:14,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1512674250, now seen corresponding path program 1 times [2025-03-03 14:59:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915023325] [2025-03-03 14:59:14,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:14,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:15,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:15,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915023325] [2025-03-03 14:59:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915023325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581814924] [2025-03-03 14:59:15,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:15,433 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 14:59:15,435 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 14:59:16,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:16,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:16,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:16,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:16,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:59:16,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:59:16,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581814924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:16,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114252000] [2025-03-03 14:59:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:16,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:16,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:16,616 INFO L87 Difference]: Start difference. First operand 3358 states and 4331 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:18,340 INFO L93 Difference]: Finished difference Result 6913 states and 8902 transitions. [2025-03-03 14:59:18,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-03-03 14:59:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:18,363 INFO L225 Difference]: With dead ends: 6913 [2025-03-03 14:59:18,363 INFO L226 Difference]: Without dead ends: 3481 [2025-03-03 14:59:18,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:18,379 INFO L435 NwaCegarLoop]: 3597 mSDtfsCounter, 1465 mSDsluCounter, 6332 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9929 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:18,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9929 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:59:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-03-03 14:59:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3345. [2025-03-03 14:59:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 2750 states have (on average 1.205818181818182) internal successors, (3316), 2789 states have internal predecessors, (3316), 496 states have call successors, (496), 98 states have call predecessors, (496), 98 states have return successors, (495), 477 states have call predecessors, (495), 495 states have call successors, (495) [2025-03-03 14:59:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4307 transitions. [2025-03-03 14:59:18,485 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4307 transitions. Word has length 208 [2025-03-03 14:59:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4307 transitions. [2025-03-03 14:59:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4307 transitions. [2025-03-03 14:59:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:18,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:18,490 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:18,501 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 14:59:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:18,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1824815452, now seen corresponding path program 1 times [2025-03-03 14:59:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266915961] [2025-03-03 14:59:18,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:19,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:19,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:59:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266915961] [2025-03-03 14:59:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266915961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534918418] [2025-03-03 14:59:19,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:19,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:19,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:19,687 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 14:59:19,689 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 14:59:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:20,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:20,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:20,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:20,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:59:20,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534918418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644830797] [2025-03-03 14:59:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:20,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:20,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:20,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:20,792 INFO L87 Difference]: Start difference. First operand 3345 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:22,907 INFO L93 Difference]: Finished difference Result 8566 states and 11043 transitions. [2025-03-03 14:59:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-03-03 14:59:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:22,934 INFO L225 Difference]: With dead ends: 8566 [2025-03-03 14:59:22,934 INFO L226 Difference]: Without dead ends: 5226 [2025-03-03 14:59:22,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:22,946 INFO L435 NwaCegarLoop]: 4436 mSDtfsCounter, 2389 mSDsluCounter, 10020 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 14456 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:22,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 14456 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 14:59:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2025-03-03 14:59:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4759. [2025-03-03 14:59:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 3852 states have (on average 1.2258566978193146) internal successors, (4722), 3912 states have internal predecessors, (4722), 753 states have call successors, (753), 151 states have call predecessors, (753), 153 states have return successors, (756), 727 states have call predecessors, (756), 752 states have call successors, (756) [2025-03-03 14:59:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6231 transitions. [2025-03-03 14:59:23,098 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6231 transitions. Word has length 209 [2025-03-03 14:59:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:23,098 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6231 transitions. [2025-03-03 14:59:23,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6231 transitions. [2025-03-03 14:59:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:23,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:23,108 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:23,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:59:23,309 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 14:59:23,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:23,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1838476523, now seen corresponding path program 1 times [2025-03-03 14:59:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943996121] [2025-03-03 14:59:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:23,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:23,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:59:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943996121] [2025-03-03 14:59:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943996121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607055233] [2025-03-03 14:59:24,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:24,054 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 14:59:24,055 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 14:59:24,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:25,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:25,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:25,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:59:25,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607055233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:25,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834254421] [2025-03-03 14:59:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:25,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:25,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:25,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:25,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:25,280 INFO L87 Difference]: Start difference. First operand 4759 states and 6231 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:26,894 INFO L93 Difference]: Finished difference Result 10675 states and 14009 transitions. [2025-03-03 14:59:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-03-03 14:59:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:26,928 INFO L225 Difference]: With dead ends: 10675 [2025-03-03 14:59:26,928 INFO L226 Difference]: Without dead ends: 5921 [2025-03-03 14:59:26,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:26,946 INFO L435 NwaCegarLoop]: 3911 mSDtfsCounter, 1754 mSDsluCounter, 6974 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 10885 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:26,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 10885 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:59:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-03-03 14:59:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5267. [2025-03-03 14:59:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 4138 states have (on average 1.263412276462059) internal successors, (5228), 4216 states have internal predecessors, (5228), 933 states have call successors, (933), 192 states have call predecessors, (933), 195 states have return successors, (935), 900 states have call predecessors, (935), 932 states have call successors, (935) [2025-03-03 14:59:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7096 transitions. [2025-03-03 14:59:27,169 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7096 transitions. Word has length 210 [2025-03-03 14:59:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7096 transitions. [2025-03-03 14:59:27,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7096 transitions. [2025-03-03 14:59:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:27,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:27,178 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:59:27,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:59:27,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:27,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -318429103, now seen corresponding path program 1 times [2025-03-03 14:59:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053339985] [2025-03-03 14:59:27,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:27,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:27,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:27,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:59:28,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053339985] [2025-03-03 14:59:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053339985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858133382] [2025-03-03 14:59:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:28,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:28,078 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 14:59:28,079 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 14:59:28,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:29,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:29,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:29,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:29,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:29,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:59:29,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:29,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858133382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:29,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:29,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257525214] [2025-03-03 14:59:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:29,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:29,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:29,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:29,126 INFO L87 Difference]: Start difference. First operand 5267 states and 7096 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:30,131 INFO L93 Difference]: Finished difference Result 10531 states and 14194 transitions. [2025-03-03 14:59:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-03-03 14:59:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:30,157 INFO L225 Difference]: With dead ends: 10531 [2025-03-03 14:59:30,157 INFO L226 Difference]: Without dead ends: 5269 [2025-03-03 14:59:30,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:30,176 INFO L435 NwaCegarLoop]: 2946 mSDtfsCounter, 1047 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 8700 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:30,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 8700 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:59:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2025-03-03 14:59:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5267. [2025-03-03 14:59:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 4138 states have (on average 1.263170613823103) internal successors, (5227), 4216 states have internal predecessors, (5227), 933 states have call successors, (933), 192 states have call predecessors, (933), 195 states have return successors, (935), 900 states have call predecessors, (935), 932 states have call successors, (935) [2025-03-03 14:59:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7095 transitions. [2025-03-03 14:59:30,322 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7095 transitions. Word has length 210 [2025-03-03 14:59:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:30,323 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 7095 transitions. [2025-03-03 14:59:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7095 transitions. [2025-03-03 14:59:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 14:59:30,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:30,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:30,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:30,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:30,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2095904412, now seen corresponding path program 1 times [2025-03-03 14:59:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377347138] [2025-03-03 14:59:30,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:30,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 14:59:30,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 14:59:30,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:30,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:59:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377347138] [2025-03-03 14:59:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377347138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795869183] [2025-03-03 14:59:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:31,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:31,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:31,342 INFO L87 Difference]: Start difference. First operand 5267 states and 7095 transitions. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:33,537 INFO L93 Difference]: Finished difference Result 9577 states and 12754 transitions. [2025-03-03 14:59:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 217 [2025-03-03 14:59:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:33,557 INFO L225 Difference]: With dead ends: 9577 [2025-03-03 14:59:33,557 INFO L226 Difference]: Without dead ends: 4315 [2025-03-03 14:59:33,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:33,571 INFO L435 NwaCegarLoop]: 3511 mSDtfsCounter, 5752 mSDsluCounter, 4577 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5752 SdHoareTripleChecker+Valid, 8088 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:33,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5752 Valid, 8088 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:59:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2025-03-03 14:59:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4177. [2025-03-03 14:59:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 3358 states have (on average 1.2355568790946991) internal successors, (4149), 3414 states have internal predecessors, (4149), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-03-03 14:59:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 5501 transitions. [2025-03-03 14:59:33,686 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 5501 transitions. Word has length 217 [2025-03-03 14:59:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 4177 states and 5501 transitions. [2025-03-03 14:59:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 5501 transitions. [2025-03-03 14:59:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 14:59:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:33,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:33,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:59:33,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1470183595, now seen corresponding path program 1 times [2025-03-03 14:59:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071746412] [2025-03-03 14:59:33,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:33,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 14:59:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 14:59:34,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:34,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:59:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071746412] [2025-03-03 14:59:34,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071746412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012189921] [2025-03-03 14:59:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:34,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:34,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:34,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:34,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:59:35,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 14:59:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 14:59:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:35,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:35,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:59:35,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012189921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:59:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119175008] [2025-03-03 14:59:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:35,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:35,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:35,404 INFO L87 Difference]: Start difference. First operand 4177 states and 5501 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:36,837 INFO L93 Difference]: Finished difference Result 8481 states and 11153 transitions. [2025-03-03 14:59:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:36,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 218 [2025-03-03 14:59:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:36,856 INFO L225 Difference]: With dead ends: 8481 [2025-03-03 14:59:36,856 INFO L226 Difference]: Without dead ends: 4309 [2025-03-03 14:59:36,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:36,871 INFO L435 NwaCegarLoop]: 2932 mSDtfsCounter, 4556 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4556 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:36,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4556 Valid, 6381 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:59:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2025-03-03 14:59:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4171. [2025-03-03 14:59:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 3355 states have (on average 1.2348733233979137) internal successors, (4143), 3411 states have internal predecessors, (4143), 673 states have call successors, (673), 141 states have call predecessors, (673), 142 states have return successors, (673), 648 states have call predecessors, (673), 672 states have call successors, (673) [2025-03-03 14:59:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5489 transitions. [2025-03-03 14:59:36,978 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5489 transitions. Word has length 218 [2025-03-03 14:59:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 5489 transitions. [2025-03-03 14:59:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5489 transitions. [2025-03-03 14:59:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:36,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:36,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:36,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:59:37,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:37,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:37,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1221623307, now seen corresponding path program 1 times [2025-03-03 14:59:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582398773] [2025-03-03 14:59:37,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:37,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:37,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:37,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:37,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:59:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582398773] [2025-03-03 14:59:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582398773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978209043] [2025-03-03 14:59:37,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:37,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:37,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:37,882 INFO L87 Difference]: Start difference. First operand 4171 states and 5489 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:39,918 INFO L93 Difference]: Finished difference Result 7857 states and 10278 transitions. [2025-03-03 14:59:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 14:59:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:39,934 INFO L225 Difference]: With dead ends: 7857 [2025-03-03 14:59:39,934 INFO L226 Difference]: Without dead ends: 3691 [2025-03-03 14:59:39,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:39,946 INFO L435 NwaCegarLoop]: 3489 mSDtfsCounter, 5730 mSDsluCounter, 4471 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5730 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:39,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5730 Valid, 7960 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:59:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-03-03 14:59:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3689. [2025-03-03 14:59:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3008 states have (on average 1.2180851063829787) internal successors, (3664), 3053 states have internal predecessors, (3664), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-03-03 14:59:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4787 transitions. [2025-03-03 14:59:40,040 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4787 transitions. Word has length 220 [2025-03-03 14:59:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:40,040 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 4787 transitions. [2025-03-03 14:59:40,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4787 transitions. [2025-03-03 14:59:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:40,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:40,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:40,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:59:40,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:40,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1047708623, now seen corresponding path program 1 times [2025-03-03 14:59:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019179671] [2025-03-03 14:59:40,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:40,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:59:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019179671] [2025-03-03 14:59:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019179671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881748436] [2025-03-03 14:59:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:40,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:40,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:40,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:59:41,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:41,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:41,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:41,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:41,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:41,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:59:41,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881748436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:59:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331764699] [2025-03-03 14:59:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:41,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:41,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:41,836 INFO L87 Difference]: Start difference. First operand 3689 states and 4787 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:43,057 INFO L93 Difference]: Finished difference Result 7373 states and 9573 transitions. [2025-03-03 14:59:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 14:59:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:43,074 INFO L225 Difference]: With dead ends: 7373 [2025-03-03 14:59:43,074 INFO L226 Difference]: Without dead ends: 3689 [2025-03-03 14:59:43,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:43,087 INFO L435 NwaCegarLoop]: 3063 mSDtfsCounter, 4472 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 6007 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:43,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 6007 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:59:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-03-03 14:59:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-03-03 14:59:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2178250748254074) internal successors, (3662), 3052 states have internal predecessors, (3662), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-03-03 14:59:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4783 transitions. [2025-03-03 14:59:43,194 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4783 transitions. Word has length 220 [2025-03-03 14:59:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4783 transitions. [2025-03-03 14:59:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4783 transitions. [2025-03-03 14:59:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:43,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:43,198 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:43,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:59:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:43,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:43,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1687520507, now seen corresponding path program 1 times [2025-03-03 14:59:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950158723] [2025-03-03 14:59:43,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:43,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950158723] [2025-03-03 14:59:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950158723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:44,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902410052] [2025-03-03 14:59:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:44,213 INFO L87 Difference]: Start difference. First operand 3687 states and 4783 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:45,894 INFO L93 Difference]: Finished difference Result 7371 states and 9567 transitions. [2025-03-03 14:59:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 14:59:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:45,910 INFO L225 Difference]: With dead ends: 7371 [2025-03-03 14:59:45,910 INFO L226 Difference]: Without dead ends: 3689 [2025-03-03 14:59:45,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:45,922 INFO L435 NwaCegarLoop]: 3391 mSDtfsCounter, 6462 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6462 SdHoareTripleChecker+Valid, 5977 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:45,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6462 Valid, 5977 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:59:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-03-03 14:59:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3687. [2025-03-03 14:59:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-03-03 14:59:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 4782 transitions. [2025-03-03 14:59:46,017 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 4782 transitions. Word has length 220 [2025-03-03 14:59:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 3687 states and 4782 transitions. [2025-03-03 14:59:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:59:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4782 transitions. [2025-03-03 14:59:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 14:59:46,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:46,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:46,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:59:46,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:46,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1511329187, now seen corresponding path program 1 times [2025-03-03 14:59:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147494404] [2025-03-03 14:59:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:46,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 14:59:46,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 14:59:46,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:46,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147494404] [2025-03-03 14:59:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147494404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634034965] [2025-03-03 14:59:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:46,626 INFO L87 Difference]: Start difference. First operand 3687 states and 4782 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:59:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:48,454 INFO L93 Difference]: Finished difference Result 7503 states and 9713 transitions. [2025-03-03 14:59:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 223 [2025-03-03 14:59:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:48,469 INFO L225 Difference]: With dead ends: 7503 [2025-03-03 14:59:48,469 INFO L226 Difference]: Without dead ends: 3821 [2025-03-03 14:59:48,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:48,481 INFO L435 NwaCegarLoop]: 3624 mSDtfsCounter, 4979 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4979 SdHoareTripleChecker+Valid, 7390 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:48,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4979 Valid, 7390 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:59:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2025-03-03 14:59:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3685. [2025-03-03 14:59:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3006 states have (on average 1.2172322022621425) internal successors, (3659), 3051 states have internal predecessors, (3659), 560 states have call successors, (560), 118 states have call predecessors, (560), 118 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-03-03 14:59:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4778 transitions. [2025-03-03 14:59:48,585 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4778 transitions. Word has length 223 [2025-03-03 14:59:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4778 transitions. [2025-03-03 14:59:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:59:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4778 transitions. [2025-03-03 14:59:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 14:59:48,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:48,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:48,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:59:48,589 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:48,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 302123942, now seen corresponding path program 1 times [2025-03-03 14:59:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594085705] [2025-03-03 14:59:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:48,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:59:48,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:59:48,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:48,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:59:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594085705] [2025-03-03 14:59:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594085705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451563805] [2025-03-03 14:59:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:49,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:49,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:49,268 INFO L87 Difference]: Start difference. First operand 3685 states and 4778 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:59:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:51,300 INFO L93 Difference]: Finished difference Result 7499 states and 9705 transitions. [2025-03-03 14:59:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 224 [2025-03-03 14:59:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:51,317 INFO L225 Difference]: With dead ends: 7499 [2025-03-03 14:59:51,317 INFO L226 Difference]: Without dead ends: 3819 [2025-03-03 14:59:51,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:51,329 INFO L435 NwaCegarLoop]: 3502 mSDtfsCounter, 4675 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 7090 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:51,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 7090 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:59:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states. [2025-03-03 14:59:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 3681. [2025-03-03 14:59:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3004 states have (on average 1.216711051930759) internal successors, (3655), 3049 states have internal predecessors, (3655), 558 states have call successors, (558), 118 states have call predecessors, (558), 118 states have return successors, (557), 537 states have call predecessors, (557), 557 states have call successors, (557) [2025-03-03 14:59:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4770 transitions. [2025-03-03 14:59:51,435 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4770 transitions. Word has length 224 [2025-03-03 14:59:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:51,436 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4770 transitions. [2025-03-03 14:59:51,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:59:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4770 transitions. [2025-03-03 14:59:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 14:59:51,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:51,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:51,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:59:51,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -369574871, now seen corresponding path program 1 times [2025-03-03 14:59:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208999394] [2025-03-03 14:59:51,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 14:59:51,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 14:59:51,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:51,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:59:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208999394] [2025-03-03 14:59:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208999394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043981585] [2025-03-03 14:59:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:52,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:52,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:52,132 INFO L87 Difference]: Start difference. First operand 3681 states and 4770 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:59:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:54,049 INFO L93 Difference]: Finished difference Result 7359 states and 9541 transitions. [2025-03-03 14:59:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225 [2025-03-03 14:59:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:54,067 INFO L225 Difference]: With dead ends: 7359 [2025-03-03 14:59:54,067 INFO L226 Difference]: Without dead ends: 3683 [2025-03-03 14:59:54,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:54,080 INFO L435 NwaCegarLoop]: 3378 mSDtfsCounter, 4408 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:54,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4408 Valid, 6681 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:59:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2025-03-03 14:59:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2025-03-03 14:59:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3004 states have (on average 1.2163781624500665) internal successors, (3654), 3049 states have internal predecessors, (3654), 558 states have call successors, (558), 118 states have call predecessors, (558), 118 states have return successors, (557), 537 states have call predecessors, (557), 557 states have call successors, (557) [2025-03-03 14:59:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4769 transitions. [2025-03-03 14:59:54,184 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4769 transitions. Word has length 225 [2025-03-03 14:59:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:54,185 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4769 transitions. [2025-03-03 14:59:54,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:59:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4769 transitions. [2025-03-03 14:59:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 14:59:54,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:54,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:54,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:59:54,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash -340874455, now seen corresponding path program 1 times [2025-03-03 14:59:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338144216] [2025-03-03 14:59:54,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 14:59:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 14:59:54,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:54,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:59:54,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338144216] [2025-03-03 14:59:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338144216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:54,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142432787] [2025-03-03 14:59:54,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:54,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:54,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:54,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:54,847 INFO L87 Difference]: Start difference. First operand 3681 states and 4769 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:59:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:56,739 INFO L93 Difference]: Finished difference Result 7491 states and 9687 transitions. [2025-03-03 14:59:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:56,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 228 [2025-03-03 14:59:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:56,755 INFO L225 Difference]: With dead ends: 7491 [2025-03-03 14:59:56,755 INFO L226 Difference]: Without dead ends: 3815 [2025-03-03 14:59:56,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:56,765 INFO L435 NwaCegarLoop]: 3611 mSDtfsCounter, 4961 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4961 SdHoareTripleChecker+Valid, 7368 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:56,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4961 Valid, 7368 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:59:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2025-03-03 14:59:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3679. [2025-03-03 14:59:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 3003 states have (on average 1.216117216117216) internal successors, (3652), 3048 states have internal predecessors, (3652), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-03 14:59:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 4765 transitions. [2025-03-03 14:59:56,867 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 4765 transitions. Word has length 228 [2025-03-03 14:59:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:56,868 INFO L471 AbstractCegarLoop]: Abstraction has 3679 states and 4765 transitions. [2025-03-03 14:59:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:59:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 4765 transitions. [2025-03-03 14:59:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 14:59:56,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:56,871 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:56,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:59:56,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash 796445981, now seen corresponding path program 1 times [2025-03-03 14:59:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:56,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57721300] [2025-03-03 14:59:56,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:57,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 14:59:57,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 14:59:57,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:59:57,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:57,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57721300] [2025-03-03 14:59:57,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57721300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:57,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:57,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:57,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248535470] [2025-03-03 14:59:57,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:57,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:57,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:57,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:57,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:57,521 INFO L87 Difference]: Start difference. First operand 3679 states and 4765 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:59:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:59,532 INFO L93 Difference]: Finished difference Result 7487 states and 9679 transitions. [2025-03-03 14:59:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229 [2025-03-03 14:59:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:59,547 INFO L225 Difference]: With dead ends: 7487 [2025-03-03 14:59:59,547 INFO L226 Difference]: Without dead ends: 3813 [2025-03-03 14:59:59,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:59,558 INFO L435 NwaCegarLoop]: 3498 mSDtfsCounter, 3719 mSDsluCounter, 5434 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3719 SdHoareTripleChecker+Valid, 8932 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:59,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3719 Valid, 8932 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:59:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2025-03-03 14:59:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3675. [2025-03-03 14:59:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 3001 states have (on average 1.2155948017327558) internal successors, (3648), 3046 states have internal predecessors, (3648), 555 states have call successors, (555), 118 states have call predecessors, (555), 118 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-03 14:59:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4757 transitions. [2025-03-03 14:59:59,657 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4757 transitions. Word has length 229 [2025-03-03 14:59:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 3675 states and 4757 transitions. [2025-03-03 14:59:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:59:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4757 transitions. [2025-03-03 14:59:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 14:59:59,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:59,660 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:59:59,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:59:59,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:59,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1962629398, now seen corresponding path program 1 times [2025-03-03 14:59:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805182255] [2025-03-03 14:59:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:59,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:00,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805182255] [2025-03-03 15:00:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805182255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248632688] [2025-03-03 15:00:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:00,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:00,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:00,334 INFO L87 Difference]: Start difference. First operand 3675 states and 4757 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:02,248 INFO L93 Difference]: Finished difference Result 7343 states and 9511 transitions. [2025-03-03 15:00:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:02,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 230 [2025-03-03 15:00:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:02,265 INFO L225 Difference]: With dead ends: 7343 [2025-03-03 15:00:02,265 INFO L226 Difference]: Without dead ends: 3673 [2025-03-03 15:00:02,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:02,277 INFO L435 NwaCegarLoop]: 3472 mSDtfsCounter, 3725 mSDsluCounter, 5277 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3725 SdHoareTripleChecker+Valid, 8749 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:02,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3725 Valid, 8749 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 15:00:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-03-03 15:00:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2025-03-03 15:00:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2999 states have (on average 1.2150716905635213) internal successors, (3644), 3044 states have internal predecessors, (3644), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-03-03 15:00:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4749 transitions. [2025-03-03 15:00:02,373 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4749 transitions. Word has length 230 [2025-03-03 15:00:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:02,373 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4749 transitions. [2025-03-03 15:00:02,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4749 transitions. [2025-03-03 15:00:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:02,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:02,376 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:02,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:00:02,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:02,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -180427826, now seen corresponding path program 1 times [2025-03-03 15:00:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799522213] [2025-03-03 15:00:02,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:02,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:02,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:02,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:02,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:03,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799522213] [2025-03-03 15:00:03,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799522213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:03,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:03,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073127457] [2025-03-03 15:00:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:03,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:03,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:03,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:03,015 INFO L87 Difference]: Start difference. First operand 3671 states and 4749 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:00:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:03,676 INFO L93 Difference]: Finished difference Result 7339 states and 9498 transitions. [2025-03-03 15:00:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 230 [2025-03-03 15:00:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:03,692 INFO L225 Difference]: With dead ends: 7339 [2025-03-03 15:00:03,692 INFO L226 Difference]: Without dead ends: 3673 [2025-03-03 15:00:03,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:03,703 INFO L435 NwaCegarLoop]: 2934 mSDtfsCounter, 1789 mSDsluCounter, 5336 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 8270 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:03,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 8270 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:00:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-03-03 15:00:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2025-03-03 15:00:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2999 states have (on average 1.2147382460820273) internal successors, (3643), 3044 states have internal predecessors, (3643), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-03-03 15:00:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4748 transitions. [2025-03-03 15:00:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4748 transitions. Word has length 230 [2025-03-03 15:00:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:03,797 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4748 transitions. [2025-03-03 15:00:03,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:00:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4748 transitions. [2025-03-03 15:00:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 15:00:03,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:03,799 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:03,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:00:03,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:03,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 713256080, now seen corresponding path program 1 times [2025-03-03 15:00:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086585500] [2025-03-03 15:00:03,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:04,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 15:00:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 15:00:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086585500] [2025-03-03 15:00:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086585500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219776457] [2025-03-03 15:00:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:04,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:04,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:04,373 INFO L87 Difference]: Start difference. First operand 3671 states and 4748 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:04,894 INFO L93 Difference]: Finished difference Result 7471 states and 9644 transitions. [2025-03-03 15:00:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:04,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-03-03 15:00:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:04,908 INFO L225 Difference]: With dead ends: 7471 [2025-03-03 15:00:04,908 INFO L226 Difference]: Without dead ends: 3805 [2025-03-03 15:00:04,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:04,918 INFO L435 NwaCegarLoop]: 3010 mSDtfsCounter, 2384 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 8679 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:04,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 8679 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-03-03 15:00:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3669. [2025-03-03 15:00:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3669 states, 2998 states have (on average 1.21447631754503) internal successors, (3641), 3043 states have internal predecessors, (3641), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-03 15:00:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4744 transitions. [2025-03-03 15:00:05,011 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4744 transitions. Word has length 233 [2025-03-03 15:00:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 3669 states and 4744 transitions. [2025-03-03 15:00:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4744 transitions. [2025-03-03 15:00:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 15:00:05,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:05,014 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:05,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:00:05,014 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1046014061, now seen corresponding path program 1 times [2025-03-03 15:00:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:05,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823192869] [2025-03-03 15:00:05,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 15:00:05,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 15:00:05,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:05,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:05,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:05,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823192869] [2025-03-03 15:00:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823192869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:05,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589801795] [2025-03-03 15:00:05,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:05,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:05,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:05,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:05,628 INFO L87 Difference]: Start difference. First operand 3669 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:06,501 INFO L93 Difference]: Finished difference Result 7469 states and 9637 transitions. [2025-03-03 15:00:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-03-03 15:00:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:06,518 INFO L225 Difference]: With dead ends: 7469 [2025-03-03 15:00:06,518 INFO L226 Difference]: Without dead ends: 3805 [2025-03-03 15:00:06,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:06,529 INFO L435 NwaCegarLoop]: 2911 mSDtfsCounter, 4516 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:06,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 6918 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:00:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-03-03 15:00:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3667. [2025-03-03 15:00:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3667 states, 2997 states have (on average 1.2142142142142143) internal successors, (3639), 3042 states have internal predecessors, (3639), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-03 15:00:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3667 states to 3667 states and 4740 transitions. [2025-03-03 15:00:06,623 INFO L78 Accepts]: Start accepts. Automaton has 3667 states and 4740 transitions. Word has length 234 [2025-03-03 15:00:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:06,623 INFO L471 AbstractCegarLoop]: Abstraction has 3667 states and 4740 transitions. [2025-03-03 15:00:06,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3667 states and 4740 transitions. [2025-03-03 15:00:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:06,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:06,625 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:06,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:00:06,626 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:06,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash -123307215, now seen corresponding path program 1 times [2025-03-03 15:00:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037094863] [2025-03-03 15:00:06,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:06,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:06,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037094863] [2025-03-03 15:00:07,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037094863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:07,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:07,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556048425] [2025-03-03 15:00:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:07,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:07,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:07,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:07,262 INFO L87 Difference]: Start difference. First operand 3667 states and 4740 transitions. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:08,181 INFO L93 Difference]: Finished difference Result 7329 states and 9477 transitions. [2025-03-03 15:00:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-03-03 15:00:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:08,200 INFO L225 Difference]: With dead ends: 7329 [2025-03-03 15:00:08,200 INFO L226 Difference]: Without dead ends: 3667 [2025-03-03 15:00:08,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:08,212 INFO L435 NwaCegarLoop]: 3038 mSDtfsCounter, 4426 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 7199 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:08,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 7199 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:00:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2025-03-03 15:00:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 3665. [2025-03-03 15:00:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2996 states have (on average 1.2139519359145527) internal successors, (3637), 3041 states have internal predecessors, (3637), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-03-03 15:00:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 4736 transitions. [2025-03-03 15:00:08,306 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 4736 transitions. Word has length 235 [2025-03-03 15:00:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 4736 transitions. [2025-03-03 15:00:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 4736 transitions. [2025-03-03 15:00:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:08,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:08,309 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:08,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:00:08,309 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1643619882, now seen corresponding path program 1 times [2025-03-03 15:00:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008697865] [2025-03-03 15:00:08,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms