./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d46cc80a8d21eeff79ba02488456fda09c76eb75ff8eedd6b93124365a06d1f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:25:19,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:25:19,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:25:19,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:25:19,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:25:19,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:25:19,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:25:19,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:25:19,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:25:19,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:25:19,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:25:19,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:25:19,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:25:19,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:25:19,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:25:19,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:25:19,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:19,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:25:19,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:19,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:25:19,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:25:19,147 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 -> d46cc80a8d21eeff79ba02488456fda09c76eb75ff8eedd6b93124365a06d1f9 [2025-01-09 05:25:19,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:25:19,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:25:19,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:25:19,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:25:19,366 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:25:19,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c [2025-01-09 05:25:20,709 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af326ae77/935b990ca1244403be5b988344497371/FLAG9de0a948b [2025-01-09 05:25:21,373 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:25:21,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c [2025-01-09 05:25:21,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af326ae77/935b990ca1244403be5b988344497371/FLAG9de0a948b [2025-01-09 05:25:21,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af326ae77/935b990ca1244403be5b988344497371 [2025-01-09 05:25:21,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:25:21,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:25:21,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:25:21,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:25:21,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:25:21,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:25:21" (1/1) ... [2025-01-09 05:25:21,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b029757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:21, skipping insertion in model container [2025-01-09 05:25:21,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:25:21" (1/1) ... [2025-01-09 05:25:22,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:25:23,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c[377612,377625] [2025-01-09 05:25:23,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:25:23,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:25:23,755 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:25:24,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c[377612,377625] [2025-01-09 05:25:24,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:25:24,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:25:24,404 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:25:24,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24 WrapperNode [2025-01-09 05:25:24,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:25:24,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:25:24,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:25:24,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:25:24,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:24,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:24,978 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-01-09 05:25:24,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:25:24,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:25:24,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:25:24,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:25:24,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:24,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:25:25,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:25:25,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:25:25,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:25:25,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:25:25,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (1/1) ... [2025-01-09 05:25:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:25:25,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:25:25,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:25:25,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:25:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:25:25,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:25:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:25:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:25:25,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:25:25,598 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:25:25,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:25:32,383 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-01-09 05:25:32,384 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:25:32,442 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:25:32,443 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 05:25:32,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:32 BoogieIcfgContainer [2025-01-09 05:25:32,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:25:32,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:25:32,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:25:32,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:25:32,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:25:21" (1/3) ... [2025-01-09 05:25:32,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fdf693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:32, skipping insertion in model container [2025-01-09 05:25:32,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:25:24" (2/3) ... [2025-01-09 05:25:32,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fdf693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:25:32, skipping insertion in model container [2025-01-09 05:25:32,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:25:32" (3/3) ... [2025-01-09 05:25:32,455 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.09.cil-1.c [2025-01-09 05:25:32,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:25:32,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.09.cil-1.c that has 7 procedures, 2488 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 05:25:32,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:25:32,679 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;@9bc5363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:25:32,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:25:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:25:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:32,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:32,698 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] [2025-01-09 05:25:32,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:32,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 313623087, now seen corresponding path program 1 times [2025-01-09 05:25:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977544709] [2025-01-09 05:25:32,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:32,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:32,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:32,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977544709] [2025-01-09 05:25:33,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977544709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:33,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:25:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030389456] [2025-01-09 05:25:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:33,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:25:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:33,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:25:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:25:33,080 INFO L87 Difference]: Start difference. First operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:33,261 INFO L93 Difference]: Finished difference Result 4967 states and 9125 transitions. [2025-01-09 05:25:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:25:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:33,289 INFO L225 Difference]: With dead ends: 4967 [2025-01-09 05:25:33,290 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 05:25:33,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:25:33,303 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 465 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 8517 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:33,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 8517 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:25:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 05:25:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2025-01-09 05:25:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2390 states have (on average 1.8330543933054393) internal successors, (4381), 2392 states have internal predecessors, (4381), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:25:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4427 transitions. [2025-01-09 05:25:33,430 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4427 transitions. Word has length 143 [2025-01-09 05:25:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4427 transitions. [2025-01-09 05:25:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4427 transitions. [2025-01-09 05:25:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:33,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:33,438 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] [2025-01-09 05:25:33,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:25:33,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:33,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 858495661, now seen corresponding path program 1 times [2025-01-09 05:25:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915866861] [2025-01-09 05:25:33,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:33,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915866861] [2025-01-09 05:25:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915866861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704863500] [2025-01-09 05:25:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:33,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:33,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:33,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:33,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:33,734 INFO L87 Difference]: Start difference. First operand 2421 states and 4427 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:34,260 INFO L93 Difference]: Finished difference Result 3023 states and 5383 transitions. [2025-01-09 05:25:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:25:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:34,272 INFO L225 Difference]: With dead ends: 3023 [2025-01-09 05:25:34,272 INFO L226 Difference]: Without dead ends: 2740 [2025-01-09 05:25:34,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:34,275 INFO L435 NwaCegarLoop]: 4321 mSDtfsCounter, 4851 mSDsluCounter, 8836 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4868 SdHoareTripleChecker+Valid, 13157 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:34,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4868 Valid, 13157 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-01-09 05:25:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2717. [2025-01-09 05:25:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.8083427282976325) internal successors, (4812), 2664 states have internal predecessors, (4812), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 05:25:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4895 transitions. [2025-01-09 05:25:34,343 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4895 transitions. Word has length 143 [2025-01-09 05:25:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:34,344 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4895 transitions. [2025-01-09 05:25:34,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4895 transitions. [2025-01-09 05:25:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:34,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:34,346 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] [2025-01-09 05:25:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:25:34,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1915106511, now seen corresponding path program 1 times [2025-01-09 05:25:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986027319] [2025-01-09 05:25:34,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:34,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:34,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:34,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:34,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 05:25:34,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:34,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986027319] [2025-01-09 05:25:34,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986027319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:34,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:34,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902545283] [2025-01-09 05:25:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:34,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:34,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:34,568 INFO L87 Difference]: Start difference. First operand 2717 states and 4895 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:35,270 INFO L93 Difference]: Finished difference Result 3674 states and 6428 transitions. [2025-01-09 05:25:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:35,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:35,282 INFO L225 Difference]: With dead ends: 3674 [2025-01-09 05:25:35,282 INFO L226 Difference]: Without dead ends: 3095 [2025-01-09 05:25:35,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:35,285 INFO L435 NwaCegarLoop]: 4567 mSDtfsCounter, 4855 mSDsluCounter, 13728 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 18295 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:35,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 18295 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-01-09 05:25:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2992. [2025-01-09 05:25:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2911 states have (on average 1.7866712469941601) internal successors, (5201), 2915 states have internal predecessors, (5201), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 05:25:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 5323 transitions. [2025-01-09 05:25:35,355 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 5323 transitions. Word has length 143 [2025-01-09 05:25:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:35,356 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 5323 transitions. [2025-01-09 05:25:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 5323 transitions. [2025-01-09 05:25:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:35,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:35,357 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] [2025-01-09 05:25:35,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:25:35,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 329451887, now seen corresponding path program 1 times [2025-01-09 05:25:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79109595] [2025-01-09 05:25:35,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:35,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79109595] [2025-01-09 05:25:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79109595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58501869] [2025-01-09 05:25:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:35,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:35,531 INFO L87 Difference]: Start difference. First operand 2992 states and 5323 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:36,156 INFO L93 Difference]: Finished difference Result 4543 states and 7799 transitions. [2025-01-09 05:25:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:36,171 INFO L225 Difference]: With dead ends: 4543 [2025-01-09 05:25:36,172 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 05:25:36,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:36,176 INFO L435 NwaCegarLoop]: 4559 mSDtfsCounter, 4847 mSDsluCounter, 13706 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 18265 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:36,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 18265 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:25:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 05:25:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3576. [2025-01-09 05:25:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3443 states have (on average 1.7542840546035434) internal successors, (6040), 3451 states have internal predecessors, (6040), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 05:25:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 6246 transitions. [2025-01-09 05:25:36,267 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 6246 transitions. Word has length 143 [2025-01-09 05:25:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:36,267 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 6246 transitions. [2025-01-09 05:25:36,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 6246 transitions. [2025-01-09 05:25:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:36,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:36,269 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] [2025-01-09 05:25:36,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:25:36,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:36,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash -763183315, now seen corresponding path program 1 times [2025-01-09 05:25:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375443192] [2025-01-09 05:25:36,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:36,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:36,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:36,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:36,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375443192] [2025-01-09 05:25:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375443192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:36,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:36,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102340001] [2025-01-09 05:25:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:36,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:36,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:36,467 INFO L87 Difference]: Start difference. First operand 3576 states and 6246 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:37,402 INFO L93 Difference]: Finished difference Result 6423 states and 10828 transitions. [2025-01-09 05:25:37,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:37,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:37,441 INFO L225 Difference]: With dead ends: 6423 [2025-01-09 05:25:37,445 INFO L226 Difference]: Without dead ends: 4985 [2025-01-09 05:25:37,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:37,458 INFO L435 NwaCegarLoop]: 4556 mSDtfsCounter, 4842 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4859 SdHoareTripleChecker+Valid, 18253 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:37,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4859 Valid, 18253 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:25:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2025-01-09 05:25:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4843. [2025-01-09 05:25:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4600 states have (on average 1.7165217391304348) internal successors, (7896), 4622 states have internal predecessors, (7896), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 05:25:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 8294 transitions. [2025-01-09 05:25:37,585 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 8294 transitions. Word has length 143 [2025-01-09 05:25:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:37,585 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 8294 transitions. [2025-01-09 05:25:37,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 8294 transitions. [2025-01-09 05:25:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:37,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:37,588 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] [2025-01-09 05:25:37,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:25:37,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2045355601, now seen corresponding path program 1 times [2025-01-09 05:25:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797648858] [2025-01-09 05:25:37,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:37,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:37,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:37,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:37,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797648858] [2025-01-09 05:25:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797648858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:37,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83263263] [2025-01-09 05:25:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:37,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:37,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:37,734 INFO L87 Difference]: Start difference. First operand 4843 states and 8294 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:38,412 INFO L93 Difference]: Finished difference Result 10560 states and 17682 transitions. [2025-01-09 05:25:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:38,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:38,442 INFO L225 Difference]: With dead ends: 10560 [2025-01-09 05:25:38,442 INFO L226 Difference]: Without dead ends: 7855 [2025-01-09 05:25:38,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:38,451 INFO L435 NwaCegarLoop]: 4553 mSDtfsCounter, 4837 mSDsluCounter, 13688 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4854 SdHoareTripleChecker+Valid, 18241 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:38,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4854 Valid, 18241 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:25:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2025-01-09 05:25:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 7656. [2025-01-09 05:25:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7656 states, 7175 states have (on average 1.6875261324041813) internal successors, (12108), 7243 states have internal predecessors, (12108), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 05:25:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 12986 transitions. [2025-01-09 05:25:38,622 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 12986 transitions. Word has length 143 [2025-01-09 05:25:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:38,622 INFO L471 AbstractCegarLoop]: Abstraction has 7656 states and 12986 transitions. [2025-01-09 05:25:38,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 12986 transitions. [2025-01-09 05:25:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:38,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:38,626 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] [2025-01-09 05:25:38,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:25:38,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:38,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash 407135981, now seen corresponding path program 1 times [2025-01-09 05:25:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592451705] [2025-01-09 05:25:38,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:38,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:38,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:38,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:38,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592451705] [2025-01-09 05:25:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592451705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584005465] [2025-01-09 05:25:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:38,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:38,741 INFO L87 Difference]: Start difference. First operand 7656 states and 12986 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:39,402 INFO L93 Difference]: Finished difference Result 19891 states and 33756 transitions. [2025-01-09 05:25:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:39,448 INFO L225 Difference]: With dead ends: 19891 [2025-01-09 05:25:39,449 INFO L226 Difference]: Without dead ends: 14373 [2025-01-09 05:25:39,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:39,470 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4864 mSDsluCounter, 13191 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4881 SdHoareTripleChecker+Valid, 17534 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:39,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4881 Valid, 17534 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:25:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2025-01-09 05:25:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14065. [2025-01-09 05:25:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.67979163474797) internal successors, (21928), 13268 states have internal predecessors, (21928), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:25:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24150 transitions. [2025-01-09 05:25:40,094 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24150 transitions. Word has length 143 [2025-01-09 05:25:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:40,094 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24150 transitions. [2025-01-09 05:25:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24150 transitions. [2025-01-09 05:25:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:40,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:40,103 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] [2025-01-09 05:25:40,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:25:40,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:40,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1314866705, now seen corresponding path program 1 times [2025-01-09 05:25:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682978643] [2025-01-09 05:25:40,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:40,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:40,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:40,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:40,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682978643] [2025-01-09 05:25:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682978643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:25:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051496426] [2025-01-09 05:25:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:25:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:40,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:25:40,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:25:40,213 INFO L87 Difference]: Start difference. First operand 14065 states and 24150 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:40,828 INFO L93 Difference]: Finished difference Result 29422 states and 51531 transitions. [2025-01-09 05:25:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:25:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:40,887 INFO L225 Difference]: With dead ends: 29422 [2025-01-09 05:25:40,887 INFO L226 Difference]: Without dead ends: 17495 [2025-01-09 05:25:40,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:40,924 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4585 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 12769 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:40,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 12769 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:25:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17495 states. [2025-01-09 05:25:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17495 to 14065. [2025-01-09 05:25:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.6772636739696645) internal successors, (21895), 13268 states have internal predecessors, (21895), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:25:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24117 transitions. [2025-01-09 05:25:41,474 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24117 transitions. Word has length 143 [2025-01-09 05:25:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24117 transitions. [2025-01-09 05:25:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24117 transitions. [2025-01-09 05:25:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:41,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:41,483 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] [2025-01-09 05:25:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:25:41,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1647509843, now seen corresponding path program 1 times [2025-01-09 05:25:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:41,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762902951] [2025-01-09 05:25:41,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:41,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:41,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:41,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:41,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762902951] [2025-01-09 05:25:41,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762902951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:41,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:41,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:41,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935372348] [2025-01-09 05:25:41,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:41,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:41,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:41,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:41,610 INFO L87 Difference]: Start difference. First operand 14065 states and 24117 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:42,994 INFO L93 Difference]: Finished difference Result 41232 states and 72411 transitions. [2025-01-09 05:25:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:42,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:43,086 INFO L225 Difference]: With dead ends: 41232 [2025-01-09 05:25:43,086 INFO L226 Difference]: Without dead ends: 29305 [2025-01-09 05:25:43,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:43,119 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 4819 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4836 SdHoareTripleChecker+Valid, 18198 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:43,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4836 Valid, 18198 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29305 states. [2025-01-09 05:25:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29305 to 28827. [2025-01-09 05:25:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28827 states, 26594 states have (on average 1.687937128675641) internal successors, (44889), 27262 states have internal predecessors, (44889), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 05:25:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28827 states to 28827 states and 51335 transitions. [2025-01-09 05:25:44,633 INFO L78 Accepts]: Start accepts. Automaton has 28827 states and 51335 transitions. Word has length 143 [2025-01-09 05:25:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 28827 states and 51335 transitions. [2025-01-09 05:25:44,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28827 states and 51335 transitions. [2025-01-09 05:25:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:44,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:44,646 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] [2025-01-09 05:25:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:25:44,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:44,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash 281422383, now seen corresponding path program 1 times [2025-01-09 05:25:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315593898] [2025-01-09 05:25:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:44,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:44,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:44,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:44,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:44,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315593898] [2025-01-09 05:25:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315593898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230805836] [2025-01-09 05:25:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:44,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:44,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:44,778 INFO L87 Difference]: Start difference. First operand 28827 states and 51335 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:46,763 INFO L93 Difference]: Finished difference Result 91456 states and 170595 transitions. [2025-01-09 05:25:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:47,148 INFO L225 Difference]: With dead ends: 91456 [2025-01-09 05:25:47,148 INFO L226 Difference]: Without dead ends: 64767 [2025-01-09 05:25:47,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:47,221 INFO L435 NwaCegarLoop]: 4539 mSDtfsCounter, 4814 mSDsluCounter, 13647 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 18186 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:47,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 18186 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:25:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64767 states. [2025-01-09 05:25:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64767 to 63940. [2025-01-09 05:25:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63940 states, 58777 states have (on average 1.7109583680691427) internal successors, (100565), 60839 states have internal predecessors, (100565), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 05:25:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63940 states to 63940 states and 121603 transitions. [2025-01-09 05:25:50,367 INFO L78 Accepts]: Start accepts. Automaton has 63940 states and 121603 transitions. Word has length 143 [2025-01-09 05:25:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:25:50,367 INFO L471 AbstractCegarLoop]: Abstraction has 63940 states and 121603 transitions. [2025-01-09 05:25:50,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 63940 states and 121603 transitions. [2025-01-09 05:25:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:25:50,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:25:50,386 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] [2025-01-09 05:25:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:25:50,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:25:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:25:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2011658643, now seen corresponding path program 1 times [2025-01-09 05:25:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:25:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663989260] [2025-01-09 05:25:50,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:25:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:25:50,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:25:50,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:25:50,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:25:50,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:25:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:25:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:25:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663989260] [2025-01-09 05:25:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663989260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:25:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:25:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:25:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487555886] [2025-01-09 05:25:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:25:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:25:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:25:50,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:25:50,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:25:50,491 INFO L87 Difference]: Start difference. First operand 63940 states and 121603 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:25:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:25:55,786 INFO L93 Difference]: Finished difference Result 218103 states and 440698 transitions. [2025-01-09 05:25:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:25:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 143 [2025-01-09 05:25:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:25:57,080 INFO L225 Difference]: With dead ends: 218103 [2025-01-09 05:25:57,080 INFO L226 Difference]: Without dead ends: 156301 [2025-01-09 05:25:57,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:25:57,240 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 4888 mSDsluCounter, 13614 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 18143 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:25:57,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 18143 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:25:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156301 states. [2025-01-09 05:26:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156301 to 146392. [2025-01-09 05:26:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146392 states, 134039 states have (on average 1.7350994859705011) internal successors, (232571), 140347 states have internal predecessors, (232571), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 7848 states have return successors, (70039), 4758 states have call predecessors, (70039), 4503 states have call successors, (70039) [2025-01-09 05:26:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146392 states to 146392 states and 307113 transitions. [2025-01-09 05:26:05,088 INFO L78 Accepts]: Start accepts. Automaton has 146392 states and 307113 transitions. Word has length 143 [2025-01-09 05:26:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:26:05,088 INFO L471 AbstractCegarLoop]: Abstraction has 146392 states and 307113 transitions. [2025-01-09 05:26:05,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:26:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 146392 states and 307113 transitions. [2025-01-09 05:26:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:26:05,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:26:05,124 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] [2025-01-09 05:26:05,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:26:05,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:26:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:26:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1540302293, now seen corresponding path program 1 times [2025-01-09 05:26:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:26:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406972649] [2025-01-09 05:26:05,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:26:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:26:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:26:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:26:05,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:26:05,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:26:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:26:05,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:26:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406972649] [2025-01-09 05:26:05,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406972649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:26:05,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:26:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:26:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681314131] [2025-01-09 05:26:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:26:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:26:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:26:05,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:26:05,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:26:05,332 INFO L87 Difference]: Start difference. First operand 146392 states and 307113 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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)