./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.13.cil-2.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/systemc/token_ring.13.cil-2.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 0dcd4461cca64e9ab41b6ad7ff4c6eaa4177bddcca1c612fa1571b77ac664a95 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:17:26,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:17:26,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:17:26,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:17:26,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:17:26,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:17:26,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:17:26,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:17:26,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:17:26,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:17:26,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:17:26,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:17:26,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:17:26,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:17:26,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:17:26,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:17:26,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:26,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:26,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:17:26,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:17:26,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:17:26,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:17:26,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:17:26,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:17:26,319 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 -> 0dcd4461cca64e9ab41b6ad7ff4c6eaa4177bddcca1c612fa1571b77ac664a95 [2025-01-09 04:17:26,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:17:26,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:17:26,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:17:26,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:17:26,561 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:17:26,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2025-01-09 04:17:27,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/326ca8590/bca755a41a874dfd81309d4c51711d5d/FLAG0b17a8675 [2025-01-09 04:17:28,002 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:17:28,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2025-01-09 04:17:28,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/326ca8590/bca755a41a874dfd81309d4c51711d5d/FLAG0b17a8675 [2025-01-09 04:17:28,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/326ca8590/bca755a41a874dfd81309d4c51711d5d [2025-01-09 04:17:28,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:17:28,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:17:28,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:28,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:17:28,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:17:28,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28, skipping insertion in model container [2025-01-09 04:17:28,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:17:28,183 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/systemc/token_ring.13.cil-2.c[671,684] [2025-01-09 04:17:28,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:28,312 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:17:28,318 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/systemc/token_ring.13.cil-2.c[671,684] [2025-01-09 04:17:28,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:28,380 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:17:28,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28 WrapperNode [2025-01-09 04:17:28,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:28,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:28,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:17:28,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:17:28,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,431 INFO L138 Inliner]: procedures = 54, calls = 70, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 891 [2025-01-09 04:17:28,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:28,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:17:28,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:17:28,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:17:28,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,453 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 04:17:28,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:17:28,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:17:28,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:17:28,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:17:28,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (1/1) ... [2025-01-09 04:17:28,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:28,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:17:28,540 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 04:17:28,545 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 04:17:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:17:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:17:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:17:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:17:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:17:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:17:28,566 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:17:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:17:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:17:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:17:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:17:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:17:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:17:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:17:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:17:28,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:17:28,672 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:17:28,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:17:29,436 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-01-09 04:17:29,436 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:17:29,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:17:29,450 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 04:17:29,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:29 BoogieIcfgContainer [2025-01-09 04:17:29,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:17:29,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:17:29,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:17:29,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:17:29,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:28" (1/3) ... [2025-01-09 04:17:29,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74347a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:29, skipping insertion in model container [2025-01-09 04:17:29,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:28" (2/3) ... [2025-01-09 04:17:29,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74347a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:29, skipping insertion in model container [2025-01-09 04:17:29,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:29" (3/3) ... [2025-01-09 04:17:29,458 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-2.c [2025-01-09 04:17:29,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:17:29,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.13.cil-2.c that has 7 procedures, 405 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-01-09 04:17:29,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:17:29,537 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;@5ef9ca90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:17:29,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:17:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 371 states have (on average 1.6226415094339623) internal successors, (602), 372 states have internal predecessors, (602), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 04:17:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:29,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:29,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:29,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash -211775475, now seen corresponding path program 1 times [2025-01-09 04:17:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392717962] [2025-01-09 04:17:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:29,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:29,934 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 04:17:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392717962] [2025-01-09 04:17:29,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392717962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:29,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:29,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:17:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546786547] [2025-01-09 04:17:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:17:29,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:29,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:17:29,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:17:29,975 INFO L87 Difference]: Start difference. First operand has 405 states, 371 states have (on average 1.6226415094339623) internal successors, (602), 372 states have internal predecessors, (602), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 04:17:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:30,057 INFO L93 Difference]: Finished difference Result 797 states and 1291 transitions. [2025-01-09 04:17:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:17:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:30,072 INFO L225 Difference]: With dead ends: 797 [2025-01-09 04:17:30,073 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 04:17:30,077 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 04:17:30,081 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 626 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 636 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 04:17:30,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 636 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:17:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 04:17:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-01-09 04:17:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 366 states have (on average 1.5819672131147542) internal successors, (579), 367 states have internal predecessors, (579), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 04:17:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 633 transitions. [2025-01-09 04:17:30,138 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 633 transitions. Word has length 186 [2025-01-09 04:17:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:30,139 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 633 transitions. [2025-01-09 04:17:30,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 04:17:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 633 transitions. [2025-01-09 04:17:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:30,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:30,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:17:30,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -739169525, now seen corresponding path program 1 times [2025-01-09 04:17:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990650756] [2025-01-09 04:17:30,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:30,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:30,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:30,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:30,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:30,428 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 04:17:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990650756] [2025-01-09 04:17:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990650756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:17:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402576449] [2025-01-09 04:17:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:30,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:17:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:30,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:17:30,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:17:30,431 INFO L87 Difference]: Start difference. First operand 400 states and 633 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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 04:17:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:31,159 INFO L93 Difference]: Finished difference Result 1210 states and 1933 transitions. [2025-01-09 04:17:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:17:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:31,165 INFO L225 Difference]: With dead ends: 1210 [2025-01-09 04:17:31,166 INFO L226 Difference]: Without dead ends: 831 [2025-01-09 04:17:31,168 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 04:17:31,169 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 1234 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:31,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1747 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-01-09 04:17:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 800. [2025-01-09 04:17:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 737 states have (on average 1.5929443690637721) internal successors, (1174), 739 states have internal predecessors, (1174), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2025-01-09 04:17:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1273 transitions. [2025-01-09 04:17:31,212 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1273 transitions. Word has length 186 [2025-01-09 04:17:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:31,213 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1273 transitions. [2025-01-09 04:17:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 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 04:17:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1273 transitions. [2025-01-09 04:17:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:31,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:31,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:17:31,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:31,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash 652873615, now seen corresponding path program 1 times [2025-01-09 04:17:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830778877] [2025-01-09 04:17:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:31,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:31,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:31,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:31,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:31,460 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 04:17:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830778877] [2025-01-09 04:17:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830778877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981673143] [2025-01-09 04:17:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:31,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:31,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:31,464 INFO L87 Difference]: Start difference. First operand 800 states and 1273 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:32,296 INFO L93 Difference]: Finished difference Result 2093 states and 3370 transitions. [2025-01-09 04:17:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:32,304 INFO L225 Difference]: With dead ends: 2093 [2025-01-09 04:17:32,304 INFO L226 Difference]: Without dead ends: 1314 [2025-01-09 04:17:32,307 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 04:17:32,309 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1246 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 3379 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:32,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 3379 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-09 04:17:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1171. [2025-01-09 04:17:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1079 states have (on average 1.5857275254865617) internal successors, (1711), 1082 states have internal predecessors, (1711), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (75), 72 states have call predecessors, (75), 71 states have call successors, (75) [2025-01-09 04:17:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1857 transitions. [2025-01-09 04:17:32,365 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1857 transitions. Word has length 186 [2025-01-09 04:17:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:32,365 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1857 transitions. [2025-01-09 04:17:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1857 transitions. [2025-01-09 04:17:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:32,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:32,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:17:32,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1223145421, now seen corresponding path program 1 times [2025-01-09 04:17:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443850111] [2025-01-09 04:17:32,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:32,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:32,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:32,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:32,564 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 04:17:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443850111] [2025-01-09 04:17:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443850111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:32,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487945762] [2025-01-09 04:17:32,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:32,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:32,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:32,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:32,566 INFO L87 Difference]: Start difference. First operand 1171 states and 1857 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:33,318 INFO L93 Difference]: Finished difference Result 3274 states and 5257 transitions. [2025-01-09 04:17:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:33,329 INFO L225 Difference]: With dead ends: 3274 [2025-01-09 04:17:33,329 INFO L226 Difference]: Without dead ends: 2124 [2025-01-09 04:17:33,332 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 04:17:33,333 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 1238 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:33,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3349 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-01-09 04:17:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1963. [2025-01-09 04:17:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1811 states have (on average 1.5891772501380452) internal successors, (2878), 1818 states have internal predecessors, (2878), 115 states have call successors, (115), 30 states have call predecessors, (115), 36 states have return successors, (131), 118 states have call predecessors, (131), 115 states have call successors, (131) [2025-01-09 04:17:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 3124 transitions. [2025-01-09 04:17:33,416 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 3124 transitions. Word has length 186 [2025-01-09 04:17:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 3124 transitions. [2025-01-09 04:17:33,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 3124 transitions. [2025-01-09 04:17:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:33,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:33,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:17:33,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 437147531, now seen corresponding path program 1 times [2025-01-09 04:17:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302959802] [2025-01-09 04:17:33,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:33,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:33,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:33,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:33,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:33,574 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 04:17:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:33,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302959802] [2025-01-09 04:17:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302959802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:33,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468820651] [2025-01-09 04:17:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:33,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:33,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:33,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:33,576 INFO L87 Difference]: Start difference. First operand 1963 states and 3124 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:34,344 INFO L93 Difference]: Finished difference Result 5842 states and 9446 transitions. [2025-01-09 04:17:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:34,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:34,362 INFO L225 Difference]: With dead ends: 5842 [2025-01-09 04:17:34,362 INFO L226 Difference]: Without dead ends: 3900 [2025-01-09 04:17:34,368 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 04:17:34,369 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1233 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:34,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 3337 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2025-01-09 04:17:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 3694. [2025-01-09 04:17:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3416 states have (on average 1.6059718969555035) internal successors, (5486), 3437 states have internal predecessors, (5486), 203 states have call successors, (203), 54 states have call predecessors, (203), 74 states have return successors, (267), 210 states have call predecessors, (267), 203 states have call successors, (267) [2025-01-09 04:17:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 5956 transitions. [2025-01-09 04:17:34,504 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 5956 transitions. Word has length 186 [2025-01-09 04:17:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:34,504 INFO L471 AbstractCegarLoop]: Abstraction has 3694 states and 5956 transitions. [2025-01-09 04:17:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 5956 transitions. [2025-01-09 04:17:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:34,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:34,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:34,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:17:34,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1104529421, now seen corresponding path program 1 times [2025-01-09 04:17:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006201467] [2025-01-09 04:17:34,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:34,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:34,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:34,661 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 04:17:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006201467] [2025-01-09 04:17:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006201467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769191160] [2025-01-09 04:17:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:34,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:34,663 INFO L87 Difference]: Start difference. First operand 3694 states and 5956 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:35,482 INFO L93 Difference]: Finished difference Result 11547 states and 19004 transitions. [2025-01-09 04:17:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:35,514 INFO L225 Difference]: With dead ends: 11547 [2025-01-09 04:17:35,515 INFO L226 Difference]: Without dead ends: 7874 [2025-01-09 04:17:35,524 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 04:17:35,525 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1228 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:35,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 3325 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2025-01-09 04:17:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 7579. [2025-01-09 04:17:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7579 states, 7031 states have (on average 1.6341914379177926) internal successors, (11490), 7098 states have internal predecessors, (11490), 379 states have call successors, (379), 102 states have call predecessors, (379), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-01-09 04:17:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 12504 transitions. [2025-01-09 04:17:35,786 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 12504 transitions. Word has length 186 [2025-01-09 04:17:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:35,787 INFO L471 AbstractCegarLoop]: Abstraction has 7579 states and 12504 transitions. [2025-01-09 04:17:35,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 12504 transitions. [2025-01-09 04:17:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:35,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:35,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:17:35,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1090699445, now seen corresponding path program 1 times [2025-01-09 04:17:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758692934] [2025-01-09 04:17:35,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:35,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:35,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:35,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:35,974 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 04:17:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758692934] [2025-01-09 04:17:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758692934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:35,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801541899] [2025-01-09 04:17:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:35,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:35,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:35,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:35,976 INFO L87 Difference]: Start difference. First operand 7579 states and 12504 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:37,182 INFO L93 Difference]: Finished difference Result 24590 states and 41638 transitions. [2025-01-09 04:17:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:37,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:37,257 INFO L225 Difference]: With dead ends: 24590 [2025-01-09 04:17:37,257 INFO L226 Difference]: Without dead ends: 17032 [2025-01-09 04:17:37,283 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 04:17:37,283 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1263 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:37,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2354 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17032 states. [2025-01-09 04:17:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17032 to 16564. [2025-01-09 04:17:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16564 states, 15422 states have (on average 1.6702113863312151) internal successors, (25758), 15635 states have internal predecessors, (25758), 731 states have call successors, (731), 198 states have call predecessors, (731), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 04:17:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 28244 transitions. [2025-01-09 04:17:37,900 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 28244 transitions. Word has length 186 [2025-01-09 04:17:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:37,900 INFO L471 AbstractCegarLoop]: Abstraction has 16564 states and 28244 transitions. [2025-01-09 04:17:37,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 28244 transitions. [2025-01-09 04:17:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:37,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:37,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:37,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:17:37,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:37,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash -745871283, now seen corresponding path program 1 times [2025-01-09 04:17:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625931842] [2025-01-09 04:17:37,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:37,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:38,057 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 04:17:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625931842] [2025-01-09 04:17:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625931842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327894535] [2025-01-09 04:17:38,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:38,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:38,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:38,059 INFO L87 Difference]: Start difference. First operand 16564 states and 28244 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:39,918 INFO L93 Difference]: Finished difference Result 55361 states and 97524 transitions. [2025-01-09 04:17:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:40,055 INFO L225 Difference]: With dead ends: 55361 [2025-01-09 04:17:40,056 INFO L226 Difference]: Without dead ends: 38818 [2025-01-09 04:17:40,094 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 04:17:40,095 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 1218 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:40,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 3301 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38818 states. [2025-01-09 04:17:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38818 to 38017. [2025-01-09 04:17:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38017 states, 35525 states have (on average 1.7102885292047854) internal successors, (60758), 36192 states have internal predecessors, (60758), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 1056 states have return successors, (5531), 1498 states have call predecessors, (5531), 1435 states have call successors, (5531) [2025-01-09 04:17:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38017 states to 38017 states and 67724 transitions. [2025-01-09 04:17:41,824 INFO L78 Accepts]: Start accepts. Automaton has 38017 states and 67724 transitions. Word has length 186 [2025-01-09 04:17:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:41,825 INFO L471 AbstractCegarLoop]: Abstraction has 38017 states and 67724 transitions. [2025-01-09 04:17:41,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38017 states and 67724 transitions. [2025-01-09 04:17:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:41,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:41,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:17:41,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 235083531, now seen corresponding path program 1 times [2025-01-09 04:17:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215550600] [2025-01-09 04:17:41,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:41,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:41,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:42,089 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 04:17:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215550600] [2025-01-09 04:17:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215550600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537945031] [2025-01-09 04:17:42,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:42,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:42,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:42,092 INFO L87 Difference]: Start difference. First operand 38017 states and 67724 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:44,762 INFO L93 Difference]: Finished difference Result 130320 states and 241818 transitions. [2025-01-09 04:17:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:45,150 INFO L225 Difference]: With dead ends: 130320 [2025-01-09 04:17:45,151 INFO L226 Difference]: Without dead ends: 92324 [2025-01-09 04:17:45,244 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 04:17:45,246 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 1213 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:45,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3289 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92324 states. [2025-01-09 04:17:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92324 to 90886. [2025-01-09 04:17:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90886 states, 85208 states have (on average 1.7509388789784996) internal successors, (149194), 87269 states have internal predecessors, (149194), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 04:17:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90886 states to 90886 states and 171264 transitions. [2025-01-09 04:17:48,180 INFO L78 Accepts]: Start accepts. Automaton has 90886 states and 171264 transitions. Word has length 186 [2025-01-09 04:17:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:48,181 INFO L471 AbstractCegarLoop]: Abstraction has 90886 states and 171264 transitions. [2025-01-09 04:17:48,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 90886 states and 171264 transitions. [2025-01-09 04:17:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:17:48,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:48,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:17:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:17:48,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:48,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1534388083, now seen corresponding path program 1 times [2025-01-09 04:17:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478616836] [2025-01-09 04:17:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:48,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:17:48,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:17:48,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:48,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:48,351 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 04:17:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478616836] [2025-01-09 04:17:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478616836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294743758] [2025-01-09 04:17:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:48,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:48,354 INFO L87 Difference]: Start difference. First operand 90886 states and 171264 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:17:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:54,143 INFO L93 Difference]: Finished difference Result 318571 states and 631864 transitions. [2025-01-09 04:17:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 186 [2025-01-09 04:17:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:55,399 INFO L225 Difference]: With dead ends: 318571 [2025-01-09 04:17:55,399 INFO L226 Difference]: Without dead ends: 227706 [2025-01-09 04:17:55,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:55,673 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 1208 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:55,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 3277 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227706 states. [2025-01-09 04:18:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227706 to 225055. [2025-01-09 04:18:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225055 states, 211547 states have (on average 1.7891532378147645) internal successors, (378490), 217854 states have internal predecessors, (378490), 5659 states have call successors, (5659), 1542 states have call predecessors, (5659), 7848 states have return successors, (71195), 5914 states have call predecessors, (71195), 5659 states have call successors, (71195) [2025-01-09 04:18:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225055 states to 225055 states and 455344 transitions. [2025-01-09 04:18:04,654 INFO L78 Accepts]: Start accepts. Automaton has 225055 states and 455344 transitions. Word has length 186 [2025-01-09 04:18:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:04,654 INFO L471 AbstractCegarLoop]: Abstraction has 225055 states and 455344 transitions. [2025-01-09 04:18:04,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 04:18:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 225055 states and 455344 transitions. [2025-01-09 04:18:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 04:18:04,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:04,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:04,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:04,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:04,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2145657141, now seen corresponding path program 1 times [2025-01-09 04:18:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35129972] [2025-01-09 04:18:04,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:04,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 04:18:04,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 04:18:04,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:04,797 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 04:18:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35129972] [2025-01-09 04:18:04,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35129972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:04,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:04,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101155569] [2025-01-09 04:18:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:04,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:04,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:04,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:04,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:04,799 INFO L87 Difference]: Start difference. First operand 225055 states and 455344 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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)