./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-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 c3428ae6a0cff233befb72334b90ad9e2070ed1c51acfcfa2fe6d4fef2ceb1ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:10:55,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:10:55,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:10:55,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:10:55,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:10:55,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:10:55,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:10:55,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:10:55,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:10:55,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:10:55,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:10:55,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:10:55,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:10:55,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:10:55,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:10:55,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:10:55,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:10:55,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:10:55,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:10:55,361 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 -> c3428ae6a0cff233befb72334b90ad9e2070ed1c51acfcfa2fe6d4fef2ceb1ff [2025-03-08 06:10:55,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:10:55,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:10:55,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:10:55,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:10:55,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:10:55,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c [2025-03-08 06:10:56,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d659278/a15262dd7b6f41e39c68d8c798b917ca/FLAG9ec0ecca4 [2025-03-08 06:10:57,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:10:57,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_nxt.2.M4-1.c [2025-03-08 06:10:57,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d659278/a15262dd7b6f41e39c68d8c798b917ca/FLAG9ec0ecca4 [2025-03-08 06:10:57,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d659278/a15262dd7b6f41e39c68d8c798b917ca [2025-03-08 06:10:57,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:10:57,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:10:57,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:10:57,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:10:57,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:10:57,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:57,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601ff6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57, skipping insertion in model container [2025-03-08 06:10:57,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:57,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:10:57,315 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_nxt.2.M4-1.c[1682,1695] [2025-03-08 06:10:57,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:10:57,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:10:57,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.ok2.i","-S") [42] [2025-03-08 06:10:57,547 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_nxt.2.M4-1.c[1682,1695] [2025-03-08 06:10:57,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:10:57,745 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:10:57,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57 WrapperNode [2025-03-08 06:10:57,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:10:57,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:10:57,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:10:57,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:10:57,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:57,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:57,962 INFO L138 Inliner]: procedures = 56, calls = 2288, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 4967 [2025-03-08 06:10:57,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:10:57,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:10:57,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:10:57,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:10:57,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:57,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,101 INFO L175 MemorySlicer]: Split 1599 memory accesses to 15 slices as follows [2, 8, 277, 285, 113, 113, 4, 186, 203, 186, 203, 8, 2, 2, 7]. 18 percent of accesses are in the largest equivalence class. The 220 initializations are split as follows [2, 0, 27, 27, 27, 27, 0, 27, 27, 27, 27, 0, 0, 0, 2]. The 235 writes are split as follows [0, 4, 27, 27, 27, 27, 0, 31, 26, 31, 26, 4, 1, 1, 3]. [2025-03-08 06:10:58,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:10:58,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:10:58,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:10:58,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:10:58,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (1/1) ... [2025-03-08 06:10:58,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:10:58,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:10:58,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:10:58,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-08 06:10:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-03-08 06:10:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-08 06:10:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-08 06:10:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-08 06:10:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-03-08 06:10:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:10:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-08 06:10:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-08 06:10:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-03-08 06:10:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-03-08 06:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-08 06:10:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-03-08 06:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-08 06:10:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-03-08 06:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:10:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-03-08 06:10:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-08 06:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-08 06:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-03-08 06:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:10:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:10:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:10:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-03-08 06:10:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-08 06:10:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-08 06:10:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-03-08 06:10:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-03-08 06:10:58,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:10:58,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:10:59,252 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-03-08 06:10:59,252 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-03-08 06:11:05,083 INFO L? ?]: Removed 351 outVars from TransFormulas that were not future-live. [2025-03-08 06:11:05,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:11:05,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:11:05,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:11:05,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:05 BoogieIcfgContainer [2025-03-08 06:11:05,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:11:05,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:11:05,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:11:05,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:11:05,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:57" (1/3) ... [2025-03-08 06:11:05,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d668e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:05, skipping insertion in model container [2025-03-08 06:11:05,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:57" (2/3) ... [2025-03-08 06:11:05,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d668e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:05, skipping insertion in model container [2025-03-08 06:11:05,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:05" (3/3) ... [2025-03-08 06:11:05,122 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_nxt.2.M4-1.c [2025-03-08 06:11:05,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:11:05,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_nxt.2.M4-1.c that has 18 procedures, 1536 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:11:05,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:11:05,225 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;@57b3f1c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:11:05,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:11:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 1536 states, 877 states have (on average 1.2565564424173319) internal successors, (1102), 1006 states have internal predecessors, (1102), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (640), 541 states have call predecessors, (640), 640 states have call successors, (640) [2025-03-08 06:11:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1311 [2025-03-08 06:11:05,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:05,287 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:05,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 729040902, now seen corresponding path program 1 times [2025-03-08 06:11:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470867656] [2025-03-08 06:11:05,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:05,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-03-08 06:11:05,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-03-08 06:11:05,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:05,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-03-08 06:11:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470867656] [2025-03-08 06:11:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470867656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:11:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700537423] [2025-03-08 06:11:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:11:06,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:11:06,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:11:07,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-03-08 06:11:07,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-03-08 06:11:07,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:07,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:07,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 3994 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 06:11:07,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:11:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 86528 trivial. 0 not checked. [2025-03-08 06:11:07,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:11:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700537423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:11:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 06:11:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856922283] [2025-03-08 06:11:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:11:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:11:07,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:11:07,844 INFO L87 Difference]: Start difference. First operand has 1536 states, 877 states have (on average 1.2565564424173319) internal successors, (1102), 1006 states have internal predecessors, (1102), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (640), 541 states have call predecessors, (640), 640 states have call successors, (640) Second operand has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-03-08 06:11:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:08,062 INFO L93 Difference]: Finished difference Result 3067 states and 5382 transitions. [2025-03-08 06:11:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:11:08,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1310 [2025-03-08 06:11:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:08,083 INFO L225 Difference]: With dead ends: 3067 [2025-03-08 06:11:08,083 INFO L226 Difference]: Without dead ends: 1531 [2025-03-08 06:11:08,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1311 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-08 06:11:08,105 INFO L435 NwaCegarLoop]: 2380 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, 2380 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-08 06:11:08,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:11:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-03-08 06:11:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2025-03-08 06:11:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 873 states have (on average 1.2554410080183276) internal successors, (1096), 1002 states have internal predecessors, (1096), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (639), 540 states have call predecessors, (639), 639 states have call successors, (639) [2025-03-08 06:11:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2375 transitions. [2025-03-08 06:11:08,388 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2375 transitions. Word has length 1310 [2025-03-08 06:11:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:08,389 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2375 transitions. [2025-03-08 06:11:08,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 2 states have call successors, (213), 2 states have call predecessors, (213), 1 states have return successors, (211), 1 states have call predecessors, (211), 2 states have call successors, (211) [2025-03-08 06:11:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2375 transitions. [2025-03-08 06:11:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1311 [2025-03-08 06:11:08,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:08,466 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:08,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:11:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 06:11:08,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:08,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -755563807, now seen corresponding path program 1 times [2025-03-08 06:11:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424006749] [2025-03-08 06:11:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:08,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1310 statements into 1 equivalence classes. [2025-03-08 06:11:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1310 of 1310 statements. [2025-03-08 06:11:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-03-08 06:11:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424006749] [2025-03-08 06:11:10,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424006749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:11:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:11:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8291142] [2025-03-08 06:11:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:10,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:11:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:11:10,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:11:10,525 INFO L87 Difference]: Start difference. First operand 1531 states and 2375 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-03-08 06:11:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:10,656 INFO L93 Difference]: Finished difference Result 3057 states and 4771 transitions. [2025-03-08 06:11:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:11:10,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) Word has length 1310 [2025-03-08 06:11:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:10,683 INFO L225 Difference]: With dead ends: 3057 [2025-03-08 06:11:10,684 INFO L226 Difference]: Without dead ends: 1531 [2025-03-08 06:11:10,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:11:10,699 INFO L435 NwaCegarLoop]: 2373 mSDtfsCounter, 0 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:10,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4736 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:11:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-03-08 06:11:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2025-03-08 06:11:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 873 states have (on average 1.254295532646048) internal successors, (1095), 1002 states have internal predecessors, (1095), 640 states have call successors, (640), 17 states have call predecessors, (640), 17 states have return successors, (639), 540 states have call predecessors, (639), 639 states have call successors, (639) [2025-03-08 06:11:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2374 transitions. [2025-03-08 06:11:10,860 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2374 transitions. Word has length 1310 [2025-03-08 06:11:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2374 transitions. [2025-03-08 06:11:10,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 2 states have call successors, (213), 2 states have call predecessors, (213), 2 states have return successors, (211), 2 states have call predecessors, (211), 2 states have call successors, (211) [2025-03-08 06:11:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2374 transitions. [2025-03-08 06:11:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1320 [2025-03-08 06:11:10,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:10,875 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:11:10,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash -630905306, now seen corresponding path program 1 times [2025-03-08 06:11:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105131801] [2025-03-08 06:11:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:11,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1319 statements into 1 equivalence classes. [2025-03-08 06:11:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1319 of 1319 statements. [2025-03-08 06:11:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-03-08 06:11:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:14,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105131801] [2025-03-08 06:11:14,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105131801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:14,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:11:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:11:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206140779] [2025-03-08 06:11:14,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:14,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:11:14,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:14,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:11:14,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:11:14,924 INFO L87 Difference]: Start difference. First operand 1531 states and 2374 transitions. Second operand has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-03-08 06:11:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:18,208 INFO L93 Difference]: Finished difference Result 3768 states and 5831 transitions. [2025-03-08 06:11:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:11:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) Word has length 1319 [2025-03-08 06:11:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:18,228 INFO L225 Difference]: With dead ends: 3768 [2025-03-08 06:11:18,228 INFO L226 Difference]: Without dead ends: 2242 [2025-03-08 06:11:18,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-08 06:11:18,243 INFO L435 NwaCegarLoop]: 3415 mSDtfsCounter, 3402 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 5819 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:18,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 5819 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 06:11:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-03-08 06:11:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2239. [2025-03-08 06:11:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1297 states have (on average 1.2289899768696992) internal successors, (1594), 1426 states have internal predecessors, (1594), 919 states have call successors, (919), 23 states have call predecessors, (919), 22 states have return successors, (918), 818 states have call predecessors, (918), 918 states have call successors, (918) [2025-03-08 06:11:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3431 transitions. [2025-03-08 06:11:18,520 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3431 transitions. Word has length 1319 [2025-03-08 06:11:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:18,526 INFO L471 AbstractCegarLoop]: Abstraction has 2239 states and 3431 transitions. [2025-03-08 06:11:18,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 66.75) internal successors, (267), 5 states have internal predecessors, (267), 4 states have call successors, (215), 2 states have call predecessors, (215), 2 states have return successors, (213), 3 states have call predecessors, (213), 4 states have call successors, (213) [2025-03-08 06:11:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3431 transitions. [2025-03-08 06:11:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2025-03-08 06:11:18,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:18,549 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:18,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:11:18,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:18,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1444016676, now seen corresponding path program 1 times [2025-03-08 06:11:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649055189] [2025-03-08 06:11:18,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:18,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1323 statements into 1 equivalence classes. [2025-03-08 06:11:18,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1323 of 1323 statements. [2025-03-08 06:11:18,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:18,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-03-08 06:11:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:20,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649055189] [2025-03-08 06:11:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649055189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:11:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:11:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579924258] [2025-03-08 06:11:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:11:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:20,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:11:20,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:11:20,078 INFO L87 Difference]: Start difference. First operand 2239 states and 3431 transitions. Second operand has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-03-08 06:11:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:22,892 INFO L93 Difference]: Finished difference Result 4004 states and 6177 transitions. [2025-03-08 06:11:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:11:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) Word has length 1323 [2025-03-08 06:11:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:22,910 INFO L225 Difference]: With dead ends: 4004 [2025-03-08 06:11:22,910 INFO L226 Difference]: Without dead ends: 2238 [2025-03-08 06:11:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 06:11:22,922 INFO L435 NwaCegarLoop]: 3408 mSDtfsCounter, 4084 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4952 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 06:11:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2025-03-08 06:11:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2235. [2025-03-08 06:11:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 1295 states have (on average 1.2277992277992278) internal successors, (1590), 1424 states have internal predecessors, (1590), 917 states have call successors, (917), 23 states have call predecessors, (917), 22 states have return successors, (916), 816 states have call predecessors, (916), 916 states have call successors, (916) [2025-03-08 06:11:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3423 transitions. [2025-03-08 06:11:23,220 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3423 transitions. Word has length 1323 [2025-03-08 06:11:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 2235 states and 3423 transitions. [2025-03-08 06:11:23,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 67.25) internal successors, (269), 5 states have internal predecessors, (269), 4 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 4 states have call successors, (214) [2025-03-08 06:11:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3423 transitions. [2025-03-08 06:11:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2025-03-08 06:11:23,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:23,246 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:23,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:11:23,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:23,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 551782380, now seen corresponding path program 1 times [2025-03-08 06:11:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796278966] [2025-03-08 06:11:23,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1324 statements into 1 equivalence classes. [2025-03-08 06:11:23,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1324 of 1324 statements. [2025-03-08 06:11:23,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:23,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 86944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 86944 trivial. 0 not checked. [2025-03-08 06:11:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796278966] [2025-03-08 06:11:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796278966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:11:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:11:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:11:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747380298] [2025-03-08 06:11:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:11:25,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:11:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:25,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:11:25,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:11:25,699 INFO L87 Difference]: Start difference. First operand 2235 states and 3423 transitions. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-03-08 06:11:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:11:29,058 INFO L93 Difference]: Finished difference Result 3670 states and 5673 transitions. [2025-03-08 06:11:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:11:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) Word has length 1324 [2025-03-08 06:11:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:11:29,084 INFO L225 Difference]: With dead ends: 3670 [2025-03-08 06:11:29,084 INFO L226 Difference]: Without dead ends: 3668 [2025-03-08 06:11:29,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:11:29,086 INFO L435 NwaCegarLoop]: 2674 mSDtfsCounter, 3940 mSDsluCounter, 6151 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4250 SdHoareTripleChecker+Valid, 8825 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1811 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:11:29,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4250 Valid, 8825 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1811 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 06:11:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2025-03-08 06:11:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3640. [2025-03-08 06:11:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3640 states, 2090 states have (on average 1.239712918660287) internal successors, (2591), 2343 states have internal predecessors, (2591), 1513 states have call successors, (1513), 36 states have call predecessors, (1513), 36 states have return successors, (1540), 1315 states have call predecessors, (1540), 1511 states have call successors, (1540) [2025-03-08 06:11:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5644 transitions. [2025-03-08 06:11:29,524 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5644 transitions. Word has length 1324 [2025-03-08 06:11:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:11:29,525 INFO L471 AbstractCegarLoop]: Abstraction has 3640 states and 5644 transitions. [2025-03-08 06:11:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 5 states have internal predecessors, (270), 3 states have call successors, (216), 3 states have call predecessors, (216), 2 states have return successors, (214), 3 states have call predecessors, (214), 3 states have call successors, (214) [2025-03-08 06:11:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5644 transitions. [2025-03-08 06:11:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1330 [2025-03-08 06:11:29,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:11:29,541 INFO L218 NwaCegarLoop]: trace histogram [209, 209, 209, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:11:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:11:29,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:11:29,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:11:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash 246644488, now seen corresponding path program 1 times [2025-03-08 06:11:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:11:29,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263665245] [2025-03-08 06:11:29,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:29,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:11:29,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1329 statements into 1 equivalence classes. [2025-03-08 06:11:36,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1329 of 1329 statements. [2025-03-08 06:11:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 426 proven. 198 refuted. 0 times theorem prover too weak. 86323 trivial. 0 not checked. [2025-03-08 06:11:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:11:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263665245] [2025-03-08 06:11:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263665245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:11:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474654672] [2025-03-08 06:11:39,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:11:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:11:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:11:39,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:11:39,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:11:39,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1329 statements into 1 equivalence classes. [2025-03-08 06:11:46,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1329 of 1329 statements. [2025-03-08 06:11:46,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:11:46,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:11:46,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 4054 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 06:11:46,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:11:46,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1 [2025-03-08 06:11:46,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 351 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 1 [2025-03-08 06:11:46,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 1 [2025-03-08 06:11:50,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:11:50,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 45 [2025-03-08 06:11:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 42710 proven. 3276 refuted. 0 times theorem prover too weak. 40961 trivial. 0 not checked. [2025-03-08 06:11:50,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:11:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 86947 backedges. 1800 proven. 678 refuted. 0 times theorem prover too weak. 84469 trivial. 0 not checked. [2025-03-08 06:11:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474654672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:11:53,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:11:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 32, 22] total 61 [2025-03-08 06:11:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615719697] [2025-03-08 06:11:53,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:11:53,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 06:11:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:11:53,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 06:11:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=3074, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 06:11:53,532 INFO L87 Difference]: Start difference. First operand 3640 states and 5644 transitions. Second operand has 61 states, 49 states have (on average 12.775510204081632) internal successors, (626), 58 states have internal predecessors, (626), 26 states have call successors, (499), 10 states have call predecessors, (499), 20 states have return successors, (496), 16 states have call predecessors, (496), 26 states have call successors, (496) [2025-03-08 06:11:54,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:11:56,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:11:58,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:00,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:02,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:05,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:07,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:08,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:10,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:11,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:12:13,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []