./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:16:36,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:16:36,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:16:36,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:16:36,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:16:36,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:16:36,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:16:36,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:16:36,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:16:36,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:16:36,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:16:36,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:16:36,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:16:36,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:16:36,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:36,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:36,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:36,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:16:36,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:16:36,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:16:36,517 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2025-01-09 04:16:36,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:16:36,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:16:36,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:16:36,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:16:36,840 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:16:36,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-01-09 04:16:38,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/936db99f3/583f96cee910498492b6d6d3aedf36e4/FLAG363bd8fed [2025-01-09 04:16:38,418 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:16:38,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-01-09 04:16:38,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/936db99f3/583f96cee910498492b6d6d3aedf36e4/FLAG363bd8fed [2025-01-09 04:16:38,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/936db99f3/583f96cee910498492b6d6d3aedf36e4 [2025-01-09 04:16:38,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:16:38,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:16:38,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:38,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:16:38,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:16:38,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0814e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38, skipping insertion in model container [2025-01-09 04:16:38,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:16:38,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c[671,684] [2025-01-09 04:16:38,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:38,702 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:16:38,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c[671,684] [2025-01-09 04:16:38,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:38,783 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:16:38,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38 WrapperNode [2025-01-09 04:16:38,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:38,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:38,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:16:38,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:16:38,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,827 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 492 [2025-01-09 04:16:38,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:38,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:16:38,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:16:38,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:16:38,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:16:38,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:16:38,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:16:38,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:16:38,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:16:38,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (1/1) ... [2025-01-09 04:16:38,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:38,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:16:38,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:16:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:16:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:16:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:16:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:16:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:16:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:16:39,064 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:16:39,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:16:39,479 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-01-09 04:16:39,479 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:16:39,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:16:39,490 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 04:16:39,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:39 BoogieIcfgContainer [2025-01-09 04:16:39,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:16:39,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:16:39,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:16:39,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:16:39,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:16:38" (1/3) ... [2025-01-09 04:16:39,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:39, skipping insertion in model container [2025-01-09 04:16:39,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:38" (2/3) ... [2025-01-09 04:16:39,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:39, skipping insertion in model container [2025-01-09 04:16:39,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:39" (3/3) ... [2025-01-09 04:16:39,498 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2025-01-09 04:16:39,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:16:39,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-2.c that has 7 procedures, 230 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-01-09 04:16:39,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:16:39,575 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;@7dd3bb73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:16:39,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:16:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 203 states have (on average 1.5862068965517242) internal successors, (322), 204 states have internal predecessors, (322), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 04:16:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:39,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:39,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] [2025-01-09 04:16:39,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:39,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1159811528, now seen corresponding path program 1 times [2025-01-09 04:16:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453281520] [2025-01-09 04:16:39,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:39,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:39,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:39,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:39,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453281520] [2025-01-09 04:16:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453281520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:16:39,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573104225] [2025-01-09 04:16:39,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:16:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:16:39,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:39,861 INFO L87 Difference]: Start difference. First operand has 230 states, 203 states have (on average 1.5862068965517242) internal successors, (322), 204 states have internal predecessors, (322), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:39,904 INFO L93 Difference]: Finished difference Result 453 states and 715 transitions. [2025-01-09 04:16:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:39,913 INFO L225 Difference]: With dead ends: 453 [2025-01-09 04:16:39,913 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 04:16:39,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:39,918 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:39,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 349 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 04:16:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-01-09 04:16:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 199 states have internal predecessors, (306), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 04:16:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 346 transitions. [2025-01-09 04:16:39,955 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 346 transitions. Word has length 109 [2025-01-09 04:16:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:39,955 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 346 transitions. [2025-01-09 04:16:39,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 346 transitions. [2025-01-09 04:16:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:39,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:39,958 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] [2025-01-09 04:16:39,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:16:39,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 706897146, now seen corresponding path program 1 times [2025-01-09 04:16:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894367262] [2025-01-09 04:16:39,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:39,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:39,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:39,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:39,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894367262] [2025-01-09 04:16:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894367262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:40,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:16:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187082957] [2025-01-09 04:16:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:40,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:40,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:40,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:16:40,184 INFO L87 Difference]: Start difference. First operand 225 states and 346 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:40,628 INFO L93 Difference]: Finished difference Result 671 states and 1044 transitions. [2025-01-09 04:16:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:40,633 INFO L225 Difference]: With dead ends: 671 [2025-01-09 04:16:40,633 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 04:16:40,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:40,638 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 639 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:40,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1016 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 04:16:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 443. [2025-01-09 04:16:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 394 states have (on average 1.5583756345177664) internal successors, (614), 396 states have internal predecessors, (614), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-01-09 04:16:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 685 transitions. [2025-01-09 04:16:40,667 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 685 transitions. Word has length 109 [2025-01-09 04:16:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:40,667 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 685 transitions. [2025-01-09 04:16:40,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 685 transitions. [2025-01-09 04:16:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:40,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:40,669 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] [2025-01-09 04:16:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:16:40,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash 524988030, now seen corresponding path program 1 times [2025-01-09 04:16:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493500787] [2025-01-09 04:16:40,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:40,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493500787] [2025-01-09 04:16:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493500787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668059515] [2025-01-09 04:16:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:40,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:40,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:40,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:40,840 INFO L87 Difference]: Start difference. First operand 443 states and 685 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:41,409 INFO L93 Difference]: Finished difference Result 1148 states and 1795 transitions. [2025-01-09 04:16:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:41,415 INFO L225 Difference]: With dead ends: 1148 [2025-01-09 04:16:41,416 INFO L226 Difference]: Without dead ends: 719 [2025-01-09 04:16:41,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:41,417 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 637 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:41,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1776 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-01-09 04:16:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 646. [2025-01-09 04:16:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 575 states have (on average 1.551304347826087) internal successors, (892), 578 states have internal predecessors, (892), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-01-09 04:16:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 996 transitions. [2025-01-09 04:16:41,462 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 996 transitions. Word has length 109 [2025-01-09 04:16:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:41,462 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 996 transitions. [2025-01-09 04:16:41,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 996 transitions. [2025-01-09 04:16:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:41,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:41,466 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] [2025-01-09 04:16:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:16:41,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash 496487740, now seen corresponding path program 1 times [2025-01-09 04:16:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:41,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182895234] [2025-01-09 04:16:41,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:41,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:41,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:41,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:41,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:41,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182895234] [2025-01-09 04:16:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182895234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:41,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:41,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:41,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606863492] [2025-01-09 04:16:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:41,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:41,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:41,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:41,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:41,642 INFO L87 Difference]: Start difference. First operand 646 states and 996 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:42,056 INFO L93 Difference]: Finished difference Result 1791 states and 2795 transitions. [2025-01-09 04:16:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:42,062 INFO L225 Difference]: With dead ends: 1791 [2025-01-09 04:16:42,062 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 04:16:42,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:42,065 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 652 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:42,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1245 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:16:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 04:16:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1077. [2025-01-09 04:16:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 960 states have (on average 1.553125) internal successors, (1491), 967 states have internal predecessors, (1491), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-01-09 04:16:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1667 transitions. [2025-01-09 04:16:42,124 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1667 transitions. Word has length 109 [2025-01-09 04:16:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:42,124 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1667 transitions. [2025-01-09 04:16:42,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1667 transitions. [2025-01-09 04:16:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:42,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:42,126 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] [2025-01-09 04:16:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:16:42,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1444094274, now seen corresponding path program 1 times [2025-01-09 04:16:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249690564] [2025-01-09 04:16:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:42,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:42,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:42,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:42,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249690564] [2025-01-09 04:16:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249690564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277069655] [2025-01-09 04:16:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:42,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:42,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:42,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:42,269 INFO L87 Difference]: Start difference. First operand 1077 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:42,765 INFO L93 Difference]: Finished difference Result 3156 states and 4956 transitions. [2025-01-09 04:16:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:42,774 INFO L225 Difference]: With dead ends: 3156 [2025-01-09 04:16:42,775 INFO L226 Difference]: Without dead ends: 2093 [2025-01-09 04:16:42,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:42,778 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 624 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:42,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1734 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2025-01-09 04:16:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1999. [2025-01-09 04:16:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1784 states have (on average 1.563340807174888) internal successors, (2789), 1805 states have internal predecessors, (2789), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-01-09 04:16:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 3133 transitions. [2025-01-09 04:16:42,935 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 3133 transitions. Word has length 109 [2025-01-09 04:16:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 1999 states and 3133 transitions. [2025-01-09 04:16:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 3133 transitions. [2025-01-09 04:16:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:42,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:42,940 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] [2025-01-09 04:16:42,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:16:42,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2080139456, now seen corresponding path program 1 times [2025-01-09 04:16:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040132527] [2025-01-09 04:16:42,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:42,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:42,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:42,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:42,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040132527] [2025-01-09 04:16:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040132527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:43,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948155752] [2025-01-09 04:16:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:43,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:43,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:43,070 INFO L87 Difference]: Start difference. First operand 1999 states and 3133 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:43,650 INFO L93 Difference]: Finished difference Result 6126 states and 9800 transitions. [2025-01-09 04:16:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:43,668 INFO L225 Difference]: With dead ends: 6126 [2025-01-09 04:16:43,669 INFO L226 Difference]: Without dead ends: 4141 [2025-01-09 04:16:43,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:43,673 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 619 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:43,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1722 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-01-09 04:16:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4014. [2025-01-09 04:16:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 3585 states have (on average 1.5813110181311019) internal successors, (5669), 3652 states have internal predecessors, (5669), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-01-09 04:16:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 6445 transitions. [2025-01-09 04:16:43,815 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 6445 transitions. Word has length 109 [2025-01-09 04:16:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:43,815 INFO L471 AbstractCegarLoop]: Abstraction has 4014 states and 6445 transitions. [2025-01-09 04:16:43,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 6445 transitions. [2025-01-09 04:16:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:43,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:43,818 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] [2025-01-09 04:16:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:16:43,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:43,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1085445758, now seen corresponding path program 1 times [2025-01-09 04:16:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091263124] [2025-01-09 04:16:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:43,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:43,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091263124] [2025-01-09 04:16:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091263124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252829570] [2025-01-09 04:16:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:43,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:43,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:43,940 INFO L87 Difference]: Start difference. First operand 4014 states and 6445 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:44,542 INFO L93 Difference]: Finished difference Result 12691 states and 20990 transitions. [2025-01-09 04:16:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:44,584 INFO L225 Difference]: With dead ends: 12691 [2025-01-09 04:16:44,585 INFO L226 Difference]: Without dead ends: 8691 [2025-01-09 04:16:44,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:44,599 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 614 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:44,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1710 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8691 states. [2025-01-09 04:16:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8691 to 8503. [2025-01-09 04:16:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8503 states, 7592 states have (on average 1.6039251844046365) internal successors, (12177), 7805 states have internal predecessors, (12177), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-01-09 04:16:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8503 states to 8503 states and 14201 transitions. [2025-01-09 04:16:44,965 INFO L78 Accepts]: Start accepts. Automaton has 8503 states and 14201 transitions. Word has length 109 [2025-01-09 04:16:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:44,966 INFO L471 AbstractCegarLoop]: Abstraction has 8503 states and 14201 transitions. [2025-01-09 04:16:44,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8503 states and 14201 transitions. [2025-01-09 04:16:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:44,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:44,972 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] [2025-01-09 04:16:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:16:44,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:44,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 499169536, now seen corresponding path program 1 times [2025-01-09 04:16:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208653174] [2025-01-09 04:16:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:44,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:44,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208653174] [2025-01-09 04:16:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208653174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505068723] [2025-01-09 04:16:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:45,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:45,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:45,065 INFO L87 Difference]: Start difference. First operand 8503 states and 14201 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:46,014 INFO L93 Difference]: Finished difference Result 28986 states and 50213 transitions. [2025-01-09 04:16:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:46,152 INFO L225 Difference]: With dead ends: 28986 [2025-01-09 04:16:46,153 INFO L226 Difference]: Without dead ends: 20497 [2025-01-09 04:16:46,191 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 04:16:46,192 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 803 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:46,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1685 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20497 states. [2025-01-09 04:16:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20497 to 18600. [2025-01-09 04:16:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18600 states, 16595 states have (on average 1.6304308526664657) internal successors, (27057), 17262 states have internal predecessors, (27057), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-01-09 04:16:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18600 states to 18600 states and 33049 transitions. [2025-01-09 04:16:47,461 INFO L78 Accepts]: Start accepts. Automaton has 18600 states and 33049 transitions. Word has length 109 [2025-01-09 04:16:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 18600 states and 33049 transitions. [2025-01-09 04:16:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 18600 states and 33049 transitions. [2025-01-09 04:16:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:47,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:47,472 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] [2025-01-09 04:16:47,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:16:47,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1459405250, now seen corresponding path program 1 times [2025-01-09 04:16:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:47,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581486943] [2025-01-09 04:16:47,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:47,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:47,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:47,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:47,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:47,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581486943] [2025-01-09 04:16:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581486943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803522872] [2025-01-09 04:16:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:47,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:47,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:47,556 INFO L87 Difference]: Start difference. First operand 18600 states and 33049 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:49,539 INFO L93 Difference]: Finished difference Result 63617 states and 119643 transitions. [2025-01-09 04:16:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:49,771 INFO L225 Difference]: With dead ends: 63617 [2025-01-09 04:16:49,772 INFO L226 Difference]: Without dead ends: 45031 [2025-01-09 04:16:49,852 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 04:16:49,853 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 656 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:49,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1669 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45031 states. [2025-01-09 04:16:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45031 to 41601. [2025-01-09 04:16:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41601 states, 36954 states have (on average 1.654299940466526) internal successors, (61133), 39015 states have internal predecessors, (61133), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-01-09 04:16:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41601 states to 41601 states and 81141 transitions. [2025-01-09 04:16:52,587 INFO L78 Accepts]: Start accepts. Automaton has 41601 states and 81141 transitions. Word has length 109 [2025-01-09 04:16:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:52,588 INFO L471 AbstractCegarLoop]: Abstraction has 41601 states and 81141 transitions. [2025-01-09 04:16:52,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41601 states and 81141 transitions. [2025-01-09 04:16:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:16:52,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:52,606 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] [2025-01-09 04:16:52,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:16:52,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 417077568, now seen corresponding path program 1 times [2025-01-09 04:16:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582686163] [2025-01-09 04:16:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:52,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:16:52,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:16:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:52,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582686163] [2025-01-09 04:16:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582686163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:52,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503612451] [2025-01-09 04:16:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:52,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:52,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:52,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:52,709 INFO L87 Difference]: Start difference. First operand 41601 states and 81141 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:57,145 INFO L93 Difference]: Finished difference Result 142684 states and 303321 transitions. [2025-01-09 04:16:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:16:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:58,021 INFO L225 Difference]: With dead ends: 142684 [2025-01-09 04:16:58,021 INFO L226 Difference]: Without dead ends: 101097 [2025-01-09 04:16:58,136 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 04:16:58,137 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 733 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:58,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1661 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:16:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101097 states. [2025-01-09 04:17:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101097 to 95686. [2025-01-09 04:17:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95686 states, 84361 states have (on average 1.6738184706203103) internal successors, (141205), 90668 states have internal predecessors, (141205), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-01-09 04:17:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95686 states to 95686 states and 213693 transitions. [2025-01-09 04:17:05,323 INFO L78 Accepts]: Start accepts. Automaton has 95686 states and 213693 transitions. Word has length 109 [2025-01-09 04:17:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:05,324 INFO L471 AbstractCegarLoop]: Abstraction has 95686 states and 213693 transitions. [2025-01-09 04:17:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 95686 states and 213693 transitions. [2025-01-09 04:17:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:17:05,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:05,364 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] [2025-01-09 04:17:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:17:05,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1462053378, now seen corresponding path program 1 times [2025-01-09 04:17:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100802805] [2025-01-09 04:17:05,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:05,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:17:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:17:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100802805] [2025-01-09 04:17:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100802805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:05,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51111005] [2025-01-09 04:17:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:05,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:05,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:05,462 INFO L87 Difference]: Start difference. First operand 95686 states and 213693 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:14,749 INFO L93 Difference]: Finished difference Result 327563 states and 830127 transitions. [2025-01-09 04:17:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 109 [2025-01-09 04:17:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:16,585 INFO L225 Difference]: With dead ends: 327563 [2025-01-09 04:17:16,586 INFO L226 Difference]: Without dead ends: 231891 [2025-01-09 04:17:17,008 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 04:17:17,009 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 733 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:17,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1176 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:17:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231891 states.