./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.13.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.13.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b2c6a3c4af8091017033117c21d8fbc40cee2009788b890a114045d77587077 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:17:21,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:17:22,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:17:22,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:17:22,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:17:22,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:17:22,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:17:22,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:17:22,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:17:22,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:17:22,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:17:22,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:17:22,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:17:22,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:17:22,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:17:22,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:22,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:17:22,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:22,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:17:22,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:17:22,058 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 -> 1b2c6a3c4af8091017033117c21d8fbc40cee2009788b890a114045d77587077 [2025-01-09 04:17:22,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:17:22,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:17:22,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:17:22,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:17:22,307 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:17:22,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.13.cil-1.c [2025-01-09 04:17:23,535 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29901d5ce/ae460e40f1954d5da02431d8badaa7eb/FLAG2b18216f9 [2025-01-09 04:17:23,864 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:17:23,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c [2025-01-09 04:17:23,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29901d5ce/ae460e40f1954d5da02431d8badaa7eb/FLAG2b18216f9 [2025-01-09 04:17:24,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29901d5ce/ae460e40f1954d5da02431d8badaa7eb [2025-01-09 04:17:24,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:17:24,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:17:24,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:24,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:17:24,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:17:24,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24, skipping insertion in model container [2025-01-09 04:17:24,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:17:24,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c[671,684] [2025-01-09 04:17:24,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:24,398 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:17:24,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c[671,684] [2025-01-09 04:17:24,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:17:24,497 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:17:24,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24 WrapperNode [2025-01-09 04:17:24,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:17:24,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:24,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:17:24,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:17:24,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,569 INFO L138 Inliner]: procedures = 54, calls = 71, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 897 [2025-01-09 04:17:24,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:17:24,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:17:24,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:17:24,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:17:24,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,606 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:17:24,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:17:24,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:17:24,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:17:24,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:17:24,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (1/1) ... [2025-01-09 04:17:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:17:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:17:24,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:17:24,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:17:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:17:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:17:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:17:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:17:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:17:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:17:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:17:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 04:17:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 04:17:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:17:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:17:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:17:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:17:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:17:24,719 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:17:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:17:24,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:17:24,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:17:24,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:17:24,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:17:25,580 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 04:17:25,580 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:17:25,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:17:25,592 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 04:17:25,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:25 BoogieIcfgContainer [2025-01-09 04:17:25,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:17:25,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:17:25,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:17:25,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:17:25,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:24" (1/3) ... [2025-01-09 04:17:25,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67202b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:25, skipping insertion in model container [2025-01-09 04:17:25,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:24" (2/3) ... [2025-01-09 04:17:25,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67202b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:25, skipping insertion in model container [2025-01-09 04:17:25,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:25" (3/3) ... [2025-01-09 04:17:25,599 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-1.c [2025-01-09 04:17:25,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:17:25,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.13.cil-1.c that has 8 procedures, 413 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-01-09 04:17:25,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:17:25,688 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;@26a3d3ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:17:25,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:17:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 413 states, 376 states have (on average 1.627659574468085) internal successors, (612), 379 states have internal predecessors, (612), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 04:17:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:25,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:25,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:25,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1381416751, now seen corresponding path program 1 times [2025-01-09 04:17:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:25,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644427995] [2025-01-09 04:17:25,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:25,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:26,094 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:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644427995] [2025-01-09 04:17:26,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644427995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:26,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:26,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:17:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100229747] [2025-01-09 04:17:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:17:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:26,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:17:26,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:17:26,116 INFO L87 Difference]: Start difference. First operand has 413 states, 376 states have (on average 1.627659574468085) internal successors, (612), 379 states have internal predecessors, (612), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:26,187 INFO L93 Difference]: Finished difference Result 812 states and 1319 transitions. [2025-01-09 04:17:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:17:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:26,195 INFO L225 Difference]: With dead ends: 812 [2025-01-09 04:17:26,196 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 04:17:26,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:17:26,201 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 638 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:26,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 648 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:17:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 04:17:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-09 04:17:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 371 states have (on average 1.587601078167116) internal successors, (589), 373 states have internal predecessors, (589), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 04:17:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 645 transitions. [2025-01-09 04:17:26,248 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 645 transitions. Word has length 187 [2025-01-09 04:17:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 645 transitions. [2025-01-09 04:17:26,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 645 transitions. [2025-01-09 04:17:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:26,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:26,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:17:26,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -550763117, now seen corresponding path program 1 times [2025-01-09 04:17:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670691719] [2025-01-09 04:17:26,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:26,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:26,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:26,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:26,567 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:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670691719] [2025-01-09 04:17:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670691719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:26,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:17:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139432559] [2025-01-09 04:17:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:26,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:17:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:17:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:17:26,572 INFO L87 Difference]: Start difference. First operand 407 states and 645 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:27,264 INFO L93 Difference]: Finished difference Result 1231 states and 1969 transitions. [2025-01-09 04:17:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:17:27,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:27,271 INFO L225 Difference]: With dead ends: 1231 [2025-01-09 04:17:27,271 INFO L226 Difference]: Without dead ends: 845 [2025-01-09 04:17:27,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:27,274 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1248 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:27,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1787 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-09 04:17:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 812. [2025-01-09 04:17:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 747 states have (on average 1.5983935742971886) internal successors, (1194), 750 states have internal predecessors, (1194), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2025-01-09 04:17:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1295 transitions. [2025-01-09 04:17:27,311 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1295 transitions. Word has length 187 [2025-01-09 04:17:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:27,311 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1295 transitions. [2025-01-09 04:17:27,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1295 transitions. [2025-01-09 04:17:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:27,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:27,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:17:27,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash -347098737, now seen corresponding path program 1 times [2025-01-09 04:17:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188727433] [2025-01-09 04:17:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:27,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:27,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:27,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:27,520 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:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188727433] [2025-01-09 04:17:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188727433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133348684] [2025-01-09 04:17:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:27,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:27,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:27,523 INFO L87 Difference]: Start difference. First operand 812 states and 1295 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:28,313 INFO L93 Difference]: Finished difference Result 2124 states and 3426 transitions. [2025-01-09 04:17:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:28,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:28,319 INFO L225 Difference]: With dead ends: 2124 [2025-01-09 04:17:28,319 INFO L226 Difference]: Without dead ends: 1333 [2025-01-09 04:17:28,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:28,322 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1259 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:28,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 3466 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-01-09 04:17:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1188. [2025-01-09 04:17:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1094 states have (on average 1.5914076782449726) internal successors, (1741), 1098 states have internal predecessors, (1741), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (75), 72 states have call predecessors, (75), 71 states have call successors, (75) [2025-01-09 04:17:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1889 transitions. [2025-01-09 04:17:28,364 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1889 transitions. Word has length 187 [2025-01-09 04:17:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:28,364 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1889 transitions. [2025-01-09 04:17:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1889 transitions. [2025-01-09 04:17:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:28,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:28,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:28,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:17:28,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:28,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash 151458065, now seen corresponding path program 1 times [2025-01-09 04:17:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571357694] [2025-01-09 04:17:28,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:28,540 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:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571357694] [2025-01-09 04:17:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571357694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834963861] [2025-01-09 04:17:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:28,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:28,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:28,542 INFO L87 Difference]: Start difference. First operand 1188 states and 1889 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:29,447 INFO L93 Difference]: Finished difference Result 3320 states and 5343 transitions. [2025-01-09 04:17:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:29,460 INFO L225 Difference]: With dead ends: 3320 [2025-01-09 04:17:29,460 INFO L226 Difference]: Without dead ends: 2153 [2025-01-09 04:17:29,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:29,466 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 1251 mSDsluCounter, 2593 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 3436 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:29,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 3436 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-09 04:17:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1990. [2025-01-09 04:17:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1836 states have (on average 1.5947712418300655) internal successors, (2928), 1844 states have internal predecessors, (2928), 117 states have call successors, (117), 31 states have call predecessors, (117), 36 states have return successors, (131), 118 states have call predecessors, (131), 115 states have call successors, (131) [2025-01-09 04:17:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3176 transitions. [2025-01-09 04:17:29,559 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3176 transitions. Word has length 187 [2025-01-09 04:17:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3176 transitions. [2025-01-09 04:17:29,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3176 transitions. [2025-01-09 04:17:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:29,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:29,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:17:29,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:29,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1555327251, now seen corresponding path program 1 times [2025-01-09 04:17:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328576177] [2025-01-09 04:17:29,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:29,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:29,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:29,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:29,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328576177] [2025-01-09 04:17:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328576177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333036627] [2025-01-09 04:17:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:29,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:29,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:29,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:29,735 INFO L87 Difference]: Start difference. First operand 1990 states and 3176 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:30,777 INFO L93 Difference]: Finished difference Result 5918 states and 9592 transitions. [2025-01-09 04:17:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:30,795 INFO L225 Difference]: With dead ends: 5918 [2025-01-09 04:17:30,796 INFO L226 Difference]: Without dead ends: 3949 [2025-01-09 04:17:30,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:30,802 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1246 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 3424 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:30,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 3424 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:17:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2025-01-09 04:17:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3741. [2025-01-09 04:17:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3461 states have (on average 1.611095059231436) internal successors, (5576), 3483 states have internal predecessors, (5576), 205 states have call successors, (205), 55 states have call predecessors, (205), 74 states have return successors, (267), 210 states have call predecessors, (267), 203 states have call successors, (267) [2025-01-09 04:17:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 6048 transitions. [2025-01-09 04:17:30,965 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 6048 transitions. Word has length 187 [2025-01-09 04:17:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:30,966 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 6048 transitions. [2025-01-09 04:17:30,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 6048 transitions. [2025-01-09 04:17:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:30,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:30,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:17:30,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 769329361, now seen corresponding path program 1 times [2025-01-09 04:17:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013963847] [2025-01-09 04:17:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:30,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:30,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:30,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:31,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013963847] [2025-01-09 04:17:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013963847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:31,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823368105] [2025-01-09 04:17:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:31,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:31,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:31,134 INFO L87 Difference]: Start difference. First operand 3741 states and 6048 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:32,032 INFO L93 Difference]: Finished difference Result 11683 states and 19270 transitions. [2025-01-09 04:17:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:32,064 INFO L225 Difference]: With dead ends: 11683 [2025-01-09 04:17:32,064 INFO L226 Difference]: Without dead ends: 7963 [2025-01-09 04:17:32,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:32,075 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 1241 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:32,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 3412 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7963 states. [2025-01-09 04:17:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7963 to 7666. [2025-01-09 04:17:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 7116 states have (on average 1.6385609893198425) internal successors, (11660), 7184 states have internal predecessors, (11660), 381 states have call successors, (381), 103 states have call predecessors, (381), 168 states have return successors, (635), 394 states have call predecessors, (635), 379 states have call successors, (635) [2025-01-09 04:17:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 12676 transitions. [2025-01-09 04:17:32,325 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 12676 transitions. Word has length 187 [2025-01-09 04:17:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:32,326 INFO L471 AbstractCegarLoop]: Abstraction has 7666 states and 12676 transitions. [2025-01-09 04:17:32,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 12676 transitions. [2025-01-09 04:17:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:32,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:32,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:17:32,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:32,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1436711251, now seen corresponding path program 1 times [2025-01-09 04:17:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090240000] [2025-01-09 04:17:32,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:32,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:32,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:32,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:32,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090240000] [2025-01-09 04:17:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090240000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:32,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138345668] [2025-01-09 04:17:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:32,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:32,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:32,445 INFO L87 Difference]: Start difference. First operand 7666 states and 12676 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:33,372 INFO L93 Difference]: Finished difference Result 24846 states and 42144 transitions. [2025-01-09 04:17:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:33,456 INFO L225 Difference]: With dead ends: 24846 [2025-01-09 04:17:33,456 INFO L226 Difference]: Without dead ends: 17201 [2025-01-09 04:17:33,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:33,486 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1277 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:33,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2403 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17201 states. [2025-01-09 04:17:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17201 to 16731. [2025-01-09 04:17:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16731 states, 15587 states have (on average 1.6737024443446462) internal successors, (26088), 15801 states have internal predecessors, (26088), 733 states have call successors, (733), 199 states have call predecessors, (733), 410 states have return successors, (1755), 762 states have call predecessors, (1755), 731 states have call successors, (1755) [2025-01-09 04:17:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 28576 transitions. [2025-01-09 04:17:33,982 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 28576 transitions. Word has length 187 [2025-01-09 04:17:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:33,982 INFO L471 AbstractCegarLoop]: Abstraction has 16731 states and 28576 transitions. [2025-01-09 04:17:33,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 28576 transitions. [2025-01-09 04:17:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:34,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:34,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:34,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:17:34,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -758517615, now seen corresponding path program 1 times [2025-01-09 04:17:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307314755] [2025-01-09 04:17:34,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:34,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:34,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:34,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307314755] [2025-01-09 04:17:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307314755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318843527] [2025-01-09 04:17:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:34,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:34,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:34,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:34,206 INFO L87 Difference]: Start difference. First operand 16731 states and 28576 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:35,599 INFO L93 Difference]: Finished difference Result 55857 states and 98510 transitions. [2025-01-09 04:17:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:35,789 INFO L225 Difference]: With dead ends: 55857 [2025-01-09 04:17:35,790 INFO L226 Difference]: Without dead ends: 39147 [2025-01-09 04:17:35,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:35,854 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 1231 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:35,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 3388 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39147 states. [2025-01-09 04:17:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39147 to 38344. [2025-01-09 04:17:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38344 states, 35850 states have (on average 1.7129149232914924) internal successors, (61408), 36518 states have internal predecessors, (61408), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 1056 states have return successors, (5531), 1498 states have call predecessors, (5531), 1435 states have call successors, (5531) [2025-01-09 04:17:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38344 states to 38344 states and 68376 transitions. [2025-01-09 04:17:37,192 INFO L78 Accepts]: Start accepts. Automaton has 38344 states and 68376 transitions. Word has length 187 [2025-01-09 04:17:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:37,193 INFO L471 AbstractCegarLoop]: Abstraction has 38344 states and 68376 transitions. [2025-01-09 04:17:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 38344 states and 68376 transitions. [2025-01-09 04:17:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:37,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:37,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:37,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:17:37,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -413689453, now seen corresponding path program 1 times [2025-01-09 04:17:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167368008] [2025-01-09 04:17:37,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:37,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:37,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:37,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:37,349 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:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167368008] [2025-01-09 04:17:37,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167368008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895241925] [2025-01-09 04:17:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:37,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:37,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:37,353 INFO L87 Difference]: Start difference. First operand 38344 states and 68376 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:40,392 INFO L93 Difference]: Finished difference Result 131296 states and 243764 transitions. [2025-01-09 04:17:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:40,676 INFO L225 Difference]: With dead ends: 131296 [2025-01-09 04:17:40,676 INFO L226 Difference]: Without dead ends: 92973 [2025-01-09 04:17:40,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:40,758 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1226 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:40,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 3376 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92973 states. [2025-01-09 04:17:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92973 to 91533. [2025-01-09 04:17:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91533 states, 85853 states have (on average 1.752810035758797) internal successors, (150484), 87915 states have internal predecessors, (150484), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 2834 states have return successors, (19227), 2970 states have call predecessors, (19227), 2843 states have call successors, (19227) [2025-01-09 04:17:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91533 states to 91533 states and 172556 transitions. [2025-01-09 04:17:43,769 INFO L78 Accepts]: Start accepts. Automaton has 91533 states and 172556 transitions. Word has length 187 [2025-01-09 04:17:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:43,769 INFO L471 AbstractCegarLoop]: Abstraction has 91533 states and 172556 transitions. [2025-01-09 04:17:43,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 91533 states and 172556 transitions. [2025-01-09 04:17:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:17:43,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:43,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:43,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:17:43,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 567265361, now seen corresponding path program 1 times [2025-01-09 04:17:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777491870] [2025-01-09 04:17:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:43,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:17:43,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:17:43,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:43,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:44,127 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:44,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777491870] [2025-01-09 04:17:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777491870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923866737] [2025-01-09 04:17:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:44,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:44,128 INFO L87 Difference]: Start difference. First operand 91533 states and 172556 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:49,708 INFO L93 Difference]: Finished difference Result 320507 states and 635730 transitions. [2025-01-09 04:17:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:49,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 187 [2025-01-09 04:17:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:51,181 INFO L225 Difference]: With dead ends: 320507 [2025-01-09 04:17:51,181 INFO L226 Difference]: Without dead ends: 228995 [2025-01-09 04:17:51,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:51,401 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1221 mSDsluCounter, 2539 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:51,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 3364 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:17:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228995 states. [2025-01-09 04:17:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228995 to 226342. [2025-01-09 04:17:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226342 states, 212832 states have (on average 1.790426251691475) internal successors, (381060), 219140 states have internal predecessors, (381060), 5661 states have call successors, (5661), 1543 states have call predecessors, (5661), 7848 states have return successors, (71195), 5914 states have call predecessors, (71195), 5659 states have call successors, (71195) [2025-01-09 04:18:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226342 states to 226342 states and 457916 transitions. [2025-01-09 04:18:00,662 INFO L78 Accepts]: Start accepts. Automaton has 226342 states and 457916 transitions. Word has length 187 [2025-01-09 04:18:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:00,663 INFO L471 AbstractCegarLoop]: Abstraction has 226342 states and 457916 transitions. [2025-01-09 04:18:00,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:18:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 226342 states and 457916 transitions. [2025-01-09 04:18:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 04:18:00,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:00,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:00,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1202206253, now seen corresponding path program 1 times [2025-01-09 04:18:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100711934] [2025-01-09 04:18:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 04:18:00,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 04:18:00,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:00,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:18:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100711934] [2025-01-09 04:18:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100711934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565889802] [2025-01-09 04:18:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:00,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:00,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:00,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:00,845 INFO L87 Difference]: Start difference. First operand 226342 states and 457916 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)