./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:24:55,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:24:55,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:24:55,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:24:55,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:24:55,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:24:55,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:24:55,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:24:55,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:24:55,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:24:55,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:24:55,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:24:55,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:24:55,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:24:55,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:55,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:24:55,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:24:55,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:24:55,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:24:55,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:24:55,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:24:55,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:24:55,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:24:55,225 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-jdk21/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 -> eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf [2025-01-09 05:24:55,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:24:55,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:24:55,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:24:55,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:24:55,503 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:24:55,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2025-01-09 05:24:56,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f800613c/7d06a57164f4430aa4aada670ba06b7b/FLAG5be25ebea [2025-01-09 05:24:57,359 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:24:57,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2025-01-09 05:24:57,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f800613c/7d06a57164f4430aa4aada670ba06b7b/FLAG5be25ebea [2025-01-09 05:24:57,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f800613c/7d06a57164f4430aa4aada670ba06b7b [2025-01-09 05:24:57,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:24:57,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:24:57,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:57,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:24:57,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:24:57,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:57" (1/1) ... [2025-01-09 05:24:57,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442f7450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:57, skipping insertion in model container [2025-01-09 05:24:57,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:24:57" (1/1) ... [2025-01-09 05:24:57,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:24:58,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[377612,377625] [2025-01-09 05:24:58,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:24:58,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:58,935 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:24:59,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[377612,377625] [2025-01-09 05:24:59,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:24:59,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:24:59,550 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:24:59,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59 WrapperNode [2025-01-09 05:24:59,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:24:59,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:59,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:24:59,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:24:59,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:24:59,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:24:59,935 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-01-09 05:24:59,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:24:59,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:24:59,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:24:59,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:24:59,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:24:59,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:24:59,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,088 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:25:00,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:25:00,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:25:00,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:25:00,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:25:00,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (1/1) ... [2025-01-09 05:25:00,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:00,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:25:00,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:25:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:25:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:25:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:25:00,519 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:25:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:25:00,519 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:25:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:25:00,519 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:25:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:25:00,519 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:25:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:25:00,520 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:25:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:25:00,520 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:25:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:25:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:25:00,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:25:00,667 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:25:00,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:25:07,360 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-01-09 05:25:07,361 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:25:07,427 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:25:07,428 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 05:25:07,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:07 BoogieIcfgContainer [2025-01-09 05:25:07,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:25:07,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:25:07,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:25:07,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:25:07,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:24:57" (1/3) ... [2025-01-09 05:25:07,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:07, skipping insertion in model container [2025-01-09 05:25:07,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:24:59" (2/3) ... [2025-01-09 05:25:07,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b9af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:07, skipping insertion in model container [2025-01-09 05:25:07,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:07" (3/3) ... [2025-01-09 05:25:07,440 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.05.cil-1.c [2025-01-09 05:25:07,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:25:07,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.05.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 05:25:07,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:25:07,556 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;@7708ace, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:25:07,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:25:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:25:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:07,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:07,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:07,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash -148207991, now seen corresponding path program 1 times [2025-01-09 05:25:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829078845] [2025-01-09 05:25:07,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:07,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:07,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:07,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:07,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829078845] [2025-01-09 05:25:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829078845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:25:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345336869] [2025-01-09 05:25:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:07,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:25:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:07,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:25:07,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:25:07,923 INFO L87 Difference]: Start difference. First operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:08,063 INFO L93 Difference]: Finished difference Result 4767 states and 8789 transitions. [2025-01-09 05:25:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:25:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:08,088 INFO L225 Difference]: With dead ends: 4767 [2025-01-09 05:25:08,088 INFO L226 Difference]: Without dead ends: 2321 [2025-01-09 05:25:08,096 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-01-09 05:25:08,098 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 301 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 8353 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:08,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:25:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-01-09 05:25:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-01-09 05:25:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2294 states have (on average 1.8417611159546643) internal successors, (4225), 2296 states have internal predecessors, (4225), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:25:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4263 transitions. [2025-01-09 05:25:08,202 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4263 transitions. Word has length 99 [2025-01-09 05:25:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:08,203 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4263 transitions. [2025-01-09 05:25:08,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4263 transitions. [2025-01-09 05:25:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:08,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:08,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:08,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:25:08,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:08,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 438068231, now seen corresponding path program 1 times [2025-01-09 05:25:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49019970] [2025-01-09 05:25:08,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:08,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:08,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:08,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49019970] [2025-01-09 05:25:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49019970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456153947] [2025-01-09 05:25:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:08,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:08,400 INFO L87 Difference]: Start difference. First operand 2321 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:08,817 INFO L93 Difference]: Finished difference Result 2715 states and 4875 transitions. [2025-01-09 05:25:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:25:08,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:08,828 INFO L225 Difference]: With dead ends: 2715 [2025-01-09 05:25:08,829 INFO L226 Difference]: Without dead ends: 2528 [2025-01-09 05:25:08,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:08,832 INFO L435 NwaCegarLoop]: 4193 mSDtfsCounter, 4511 mSDsluCounter, 8500 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12693 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:08,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12693 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:25:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-01-09 05:25:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2513. [2025-01-09 05:25:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.822312373225152) internal successors, (4492), 2468 states have internal predecessors, (4492), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 05:25:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4559 transitions. [2025-01-09 05:25:08,946 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4559 transitions. Word has length 99 [2025-01-09 05:25:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:08,946 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4559 transitions. [2025-01-09 05:25:08,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4559 transitions. [2025-01-09 05:25:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:08,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:08,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:08,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:25:08,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:08,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1145839477, now seen corresponding path program 1 times [2025-01-09 05:25:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:08,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387635036] [2025-01-09 05:25:08,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:08,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:08,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:08,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:09,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:09,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387635036] [2025-01-09 05:25:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387635036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:09,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668452906] [2025-01-09 05:25:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:09,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:09,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:09,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:09,146 INFO L87 Difference]: Start difference. First operand 2513 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:09,621 INFO L93 Difference]: Finished difference Result 3134 states and 5528 transitions. [2025-01-09 05:25:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:09,636 INFO L225 Difference]: With dead ends: 3134 [2025-01-09 05:25:09,636 INFO L226 Difference]: Without dead ends: 2755 [2025-01-09 05:25:09,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:09,639 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4507 mSDsluCounter, 13032 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 17379 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:09,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 17379 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-01-09 05:25:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2692. [2025-01-09 05:25:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2623 states have (on average 1.8044224170796797) internal successors, (4733), 2627 states have internal predecessors, (4733), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 05:25:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4831 transitions. [2025-01-09 05:25:09,699 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4831 transitions. Word has length 99 [2025-01-09 05:25:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:09,700 INFO L471 AbstractCegarLoop]: Abstraction has 2692 states and 4831 transitions. [2025-01-09 05:25:09,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4831 transitions. [2025-01-09 05:25:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:09,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:09,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:25:09,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 420918473, now seen corresponding path program 1 times [2025-01-09 05:25:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374385015] [2025-01-09 05:25:09,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:09,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374385015] [2025-01-09 05:25:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374385015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:09,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31386842] [2025-01-09 05:25:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:09,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:09,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:09,860 INFO L87 Difference]: Start difference. First operand 2692 states and 4831 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:10,369 INFO L93 Difference]: Finished difference Result 3691 states and 6383 transitions. [2025-01-09 05:25:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:10,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:10,390 INFO L225 Difference]: With dead ends: 3691 [2025-01-09 05:25:10,390 INFO L226 Difference]: Without dead ends: 3133 [2025-01-09 05:25:10,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:10,394 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 4499 mSDsluCounter, 13010 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4512 SdHoareTripleChecker+Valid, 17349 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:10,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4512 Valid, 17349 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:25:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-01-09 05:25:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3068. [2025-01-09 05:25:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 2955 states have (on average 1.7746192893401016) internal successors, (5244), 2963 states have internal predecessors, (5244), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 05:25:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 5410 transitions. [2025-01-09 05:25:10,558 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 5410 transitions. Word has length 99 [2025-01-09 05:25:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:10,558 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 5410 transitions. [2025-01-09 05:25:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 5410 transitions. [2025-01-09 05:25:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:10,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:10,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:25:10,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -721583993, now seen corresponding path program 1 times [2025-01-09 05:25:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938774558] [2025-01-09 05:25:10,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:10,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:10,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:10,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938774558] [2025-01-09 05:25:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938774558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:10,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:10,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967784633] [2025-01-09 05:25:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:10,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:10,709 INFO L87 Difference]: Start difference. First operand 3068 states and 5410 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:11,197 INFO L93 Difference]: Finished difference Result 4883 states and 8252 transitions. [2025-01-09 05:25:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:11,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:11,212 INFO L225 Difference]: With dead ends: 4883 [2025-01-09 05:25:11,212 INFO L226 Difference]: Without dead ends: 3949 [2025-01-09 05:25:11,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:11,217 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4494 mSDsluCounter, 13001 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 17337 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 17337 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2025-01-09 05:25:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3871. [2025-01-09 05:25:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3664 states have (on average 1.732532751091703) internal successors, (6348), 3686 states have internal predecessors, (6348), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 05:25:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 6674 transitions. [2025-01-09 05:25:11,316 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 6674 transitions. Word has length 99 [2025-01-09 05:25:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:11,316 INFO L471 AbstractCegarLoop]: Abstraction has 3871 states and 6674 transitions. [2025-01-09 05:25:11,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 6674 transitions. [2025-01-09 05:25:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:11,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:11,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:11,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:25:11,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:11,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -481344247, now seen corresponding path program 1 times [2025-01-09 05:25:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554767910] [2025-01-09 05:25:11,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:11,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:11,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:11,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:11,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554767910] [2025-01-09 05:25:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554767910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206112550] [2025-01-09 05:25:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:11,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:11,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:11,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:11,424 INFO L87 Difference]: Start difference. First operand 3871 states and 6674 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:11,936 INFO L93 Difference]: Finished difference Result 7452 states and 12402 transitions. [2025-01-09 05:25:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:11,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:11,956 INFO L225 Difference]: With dead ends: 7452 [2025-01-09 05:25:11,957 INFO L226 Difference]: Without dead ends: 5715 [2025-01-09 05:25:11,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:11,962 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4489 mSDsluCounter, 12992 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 17325 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:11,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 17325 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-01-09 05:25:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5612. [2025-01-09 05:25:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5199 states have (on average 1.6864781688786306) internal successors, (8768), 5267 states have internal predecessors, (8768), 243 states have call successors, (243), 102 states have call predecessors, (243), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 05:25:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 9510 transitions. [2025-01-09 05:25:12,119 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 9510 transitions. Word has length 99 [2025-01-09 05:25:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:12,119 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 9510 transitions. [2025-01-09 05:25:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 9510 transitions. [2025-01-09 05:25:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:12,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:12,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:12,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:25:12,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 357689415, now seen corresponding path program 1 times [2025-01-09 05:25:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604538232] [2025-01-09 05:25:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:12,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:12,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604538232] [2025-01-09 05:25:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604538232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:12,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:12,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:12,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991892881] [2025-01-09 05:25:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:12,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:12,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:12,226 INFO L87 Difference]: Start difference. First operand 5612 states and 9510 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:12,818 INFO L93 Difference]: Finished difference Result 13711 states and 22877 transitions. [2025-01-09 05:25:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:12,874 INFO L225 Difference]: With dead ends: 13711 [2025-01-09 05:25:12,874 INFO L226 Difference]: Without dead ends: 10233 [2025-01-09 05:25:12,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:12,890 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4673 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 16877 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:12,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 16877 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:25:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10233 states. [2025-01-09 05:25:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10233 to 9397. [2025-01-09 05:25:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9397 states, 8534 states have (on average 1.6531520974923835) internal successors, (14108), 8748 states have internal predecessors, (14108), 451 states have call successors, (451), 198 states have call predecessors, (451), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 05:25:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9397 states to 9397 states and 16034 transitions. [2025-01-09 05:25:13,370 INFO L78 Accepts]: Start accepts. Automaton has 9397 states and 16034 transitions. Word has length 99 [2025-01-09 05:25:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:13,374 INFO L471 AbstractCegarLoop]: Abstraction has 9397 states and 16034 transitions. [2025-01-09 05:25:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9397 states and 16034 transitions. [2025-01-09 05:25:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:13,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:13,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:13,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:25:13,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 384755017, now seen corresponding path program 1 times [2025-01-09 05:25:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692493339] [2025-01-09 05:25:13,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:13,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:13,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:13,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692493339] [2025-01-09 05:25:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692493339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943546669] [2025-01-09 05:25:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:13,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:13,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:13,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:13,521 INFO L87 Difference]: Start difference. First operand 9397 states and 16034 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:14,437 INFO L93 Difference]: Finished difference Result 26418 states and 46011 transitions. [2025-01-09 05:25:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:14,500 INFO L225 Difference]: With dead ends: 26418 [2025-01-09 05:25:14,501 INFO L226 Difference]: Without dead ends: 19155 [2025-01-09 05:25:14,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:14,520 INFO L435 NwaCegarLoop]: 4324 mSDtfsCounter, 4521 mSDsluCounter, 12960 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 17284 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2025-01-09 05:25:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 17682. [2025-01-09 05:25:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17682 states, 15773 states have (on average 1.6364673809674761) internal successors, (25812), 16441 states have internal predecessors, (25812), 851 states have call successors, (851), 390 states have call predecessors, (851), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 05:25:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 31610 transitions. [2025-01-09 05:25:15,669 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 31610 transitions. Word has length 99 [2025-01-09 05:25:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:15,672 INFO L471 AbstractCegarLoop]: Abstraction has 17682 states and 31610 transitions. [2025-01-09 05:25:15,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 31610 transitions. [2025-01-09 05:25:15,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:15,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:15,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:25:15,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1692581881, now seen corresponding path program 1 times [2025-01-09 05:25:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565911881] [2025-01-09 05:25:15,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:15,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:15,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:15,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565911881] [2025-01-09 05:25:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565911881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391890466] [2025-01-09 05:25:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:15,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:15,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:15,778 INFO L87 Difference]: Start difference. First operand 17682 states and 31610 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:17,215 INFO L93 Difference]: Finished difference Result 54225 states and 102961 transitions. [2025-01-09 05:25:17,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:17,377 INFO L225 Difference]: With dead ends: 54225 [2025-01-09 05:25:17,377 INFO L226 Difference]: Without dead ends: 38677 [2025-01-09 05:25:17,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:17,505 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4578 mSDsluCounter, 12954 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17276 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:17,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17276 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38677 states. [2025-01-09 05:25:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38677 to 36471. [2025-01-09 05:25:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36471 states, 32016 states have (on average 1.6324337831084457) internal successors, (52264), 34078 states have internal predecessors, (52264), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 05:25:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36471 states to 36471 states and 71886 transitions. [2025-01-09 05:25:19,644 INFO L78 Accepts]: Start accepts. Automaton has 36471 states and 71886 transitions. Word has length 99 [2025-01-09 05:25:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:19,644 INFO L471 AbstractCegarLoop]: Abstraction has 36471 states and 71886 transitions. [2025-01-09 05:25:19,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 36471 states and 71886 transitions. [2025-01-09 05:25:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:19,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:25:19,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 41522569, now seen corresponding path program 1 times [2025-01-09 05:25:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262004280] [2025-01-09 05:25:19,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:19,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:19,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:19,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:19,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262004280] [2025-01-09 05:25:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262004280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:19,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:19,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810924730] [2025-01-09 05:25:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:19,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:19,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:19,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:19,750 INFO L87 Difference]: Start difference. First operand 36471 states and 71886 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:22,914 INFO L93 Difference]: Finished difference Result 116652 states and 255663 transitions. [2025-01-09 05:25:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:23,544 INFO L225 Difference]: With dead ends: 116652 [2025-01-09 05:25:23,545 INFO L226 Difference]: Without dead ends: 82315 [2025-01-09 05:25:23,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:23,631 INFO L435 NwaCegarLoop]: 4319 mSDtfsCounter, 4543 mSDsluCounter, 12945 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 17264 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:23,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 17264 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82315 states. [2025-01-09 05:25:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82315 to 78960. [2025-01-09 05:25:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78960 states, 68019 states have (on average 1.6290742292594715) internal successors, (110808), 74327 states have internal predecessors, (110808), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:25:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78960 states to 78960 states and 182526 transitions. [2025-01-09 05:25:28,941 INFO L78 Accepts]: Start accepts. Automaton has 78960 states and 182526 transitions. Word has length 99 [2025-01-09 05:25:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:28,941 INFO L471 AbstractCegarLoop]: Abstraction has 78960 states and 182526 transitions. [2025-01-09 05:25:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 78960 states and 182526 transitions. [2025-01-09 05:25:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:28,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:28,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:28,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:25:28,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:28,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 928745415, now seen corresponding path program 1 times [2025-01-09 05:25:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122321802] [2025-01-09 05:25:28,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:28,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:28,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:28,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:28,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:28,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122321802] [2025-01-09 05:25:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122321802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231168205] [2025-01-09 05:25:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:29,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:29,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:29,079 INFO L87 Difference]: Start difference. First operand 78960 states and 182526 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:33,948 INFO L93 Difference]: Finished difference Result 168912 states and 433689 transitions. [2025-01-09 05:25:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:25:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:34,739 INFO L225 Difference]: With dead ends: 168912 [2025-01-09 05:25:34,739 INFO L226 Difference]: Without dead ends: 92086 [2025-01-09 05:25:34,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:34,922 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4343 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 12399 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:34,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 12399 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:25:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92086 states. [2025-01-09 05:25:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92086 to 78960. [2025-01-09 05:25:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78960 states, 68019 states have (on average 1.6252958732118967) internal successors, (110551), 74327 states have internal predecessors, (110551), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:25:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78960 states to 78960 states and 182269 transitions. [2025-01-09 05:25:43,457 INFO L78 Accepts]: Start accepts. Automaton has 78960 states and 182269 transitions. Word has length 99 [2025-01-09 05:25:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:43,457 INFO L471 AbstractCegarLoop]: Abstraction has 78960 states and 182269 transitions. [2025-01-09 05:25:43,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 78960 states and 182269 transitions. [2025-01-09 05:25:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:25:43,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:43,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:25:43,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:25:43,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1005646213, now seen corresponding path program 1 times [2025-01-09 05:25:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162944604] [2025-01-09 05:25:43,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:43,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:25:43,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:25:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162944604] [2025-01-09 05:25:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162944604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:25:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820961902] [2025-01-09 05:25:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:25:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:43,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:25:43,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:25:43,535 INFO L87 Difference]: Start difference. First operand 78960 states and 182269 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:49,345 INFO L93 Difference]: Finished difference Result 199693 states and 459630 transitions. [2025-01-09 05:25:49,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:25:49,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:25:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:50,096 INFO L225 Difference]: With dead ends: 199693 [2025-01-09 05:25:50,096 INFO L226 Difference]: Without dead ends: 122868 [2025-01-09 05:25:50,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:25:50,313 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 4477 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 8977 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:50,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 8977 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:25:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122868 states.