./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:08:17,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:08:17,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:08:17,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:08:17,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:08:17,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:08:17,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:08:17,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:08:17,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:08:17,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:08:17,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:08:17,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:08:17,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:08:17,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:08:17,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:08:17,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:17,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:08:17,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:08:17,937 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 -> 695981a417316c4c07ccb52b1c4d12f1832a3ea99763b6fdb28c03b28d3203ad [2025-02-05 17:08:18,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:08:18,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:08:18,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:08:18,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:08:18,183 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:08:18,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2025-02-05 17:08:19,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e483188d0/40e8601d17df49dfaf11c58556e38126/FLAG0db0f21b0 [2025-02-05 17:08:20,043 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:08:20,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c [2025-02-05 17:08:20,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e483188d0/40e8601d17df49dfaf11c58556e38126/FLAG0db0f21b0 [2025-02-05 17:08:20,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e483188d0/40e8601d17df49dfaf11c58556e38126 [2025-02-05 17:08:20,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:08:20,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:08:20,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:20,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:08:20,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:08:20,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:20" (1/1) ... [2025-02-05 17:08:20,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2456a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:20, skipping insertion in model container [2025-02-05 17:08:20,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:08:20" (1/1) ... [2025-02-05 17:08:20,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:08:21,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2025-02-05 17:08:21,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2025-02-05 17:08:22,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:22,115 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:08:22,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[378560,378573] [2025-02-05 17:08:22,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-2.c[383339,383352] [2025-02-05 17:08:22,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:08:22,711 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:08:22,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22 WrapperNode [2025-02-05 17:08:22,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:08:22,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:22,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:08:22,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:08:22,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:22,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,341 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-02-05 17:08:23,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:08:23,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:08:23,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:08:23,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:08:23,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,462 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-02-05 17:08:23,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:08:23,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:08:23,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:08:23,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:08:23,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (1/1) ... [2025-02-05 17:08:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:08:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:08:23,750 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-02-05 17:08:23,757 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-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:08:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:08:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:08:23,874 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:08:23,876 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:08:29,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:08:29,912 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:08:29,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:08:29,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:08:29,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:08:29,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:08:29,913 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:08:30,122 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2025-02-05 17:08:30,122 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:08:30,181 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:08:30,181 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:08:30,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:30 BoogieIcfgContainer [2025-02-05 17:08:30,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:08:30,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:08:30,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:08:30,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:08:30,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:08:20" (1/3) ... [2025-02-05 17:08:30,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a49d975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:30, skipping insertion in model container [2025-02-05 17:08:30,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:08:22" (2/3) ... [2025-02-05 17:08:30,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a49d975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:08:30, skipping insertion in model container [2025-02-05 17:08:30,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:08:30" (3/3) ... [2025-02-05 17:08:30,191 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.09.cil-2.c [2025-02-05 17:08:30,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:08:30,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.09.cil-2.c that has 8 procedures, 2518 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:08:30,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:08:30,314 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;@5dcdb490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:08:30,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:08:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 2518 states, 2483 states have (on average 1.8352799033427305) internal successors, (4557), 2488 states have internal predecessors, (4557), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:08:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:30,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:30,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:08:30,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:30,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 131631439, now seen corresponding path program 1 times [2025-02-05 17:08:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637576386] [2025-02-05 17:08:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:30,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:30,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:30,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:30,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:30,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637576386] [2025-02-05 17:08:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637576386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296934613] [2025-02-05 17:08:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:30,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:30,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:30,881 INFO L87 Difference]: Start difference. First operand has 2518 states, 2483 states have (on average 1.8352799033427305) internal successors, (4557), 2488 states have internal predecessors, (4557), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-02-05 17:08:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:31,889 INFO L93 Difference]: Finished difference Result 5369 states and 9751 transitions. [2025-02-05 17:08:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:08:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:31,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:31,918 INFO L225 Difference]: With dead ends: 5369 [2025-02-05 17:08:31,918 INFO L226 Difference]: Without dead ends: 2798 [2025-02-05 17:08:31,928 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-02-05 17:08:31,932 INFO L435 NwaCegarLoop]: 4425 mSDtfsCounter, 4955 mSDsluCounter, 9078 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4972 SdHoareTripleChecker+Valid, 13503 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:31,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4972 Valid, 13503 Invalid, 568 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:08:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-02-05 17:08:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2773. [2025-02-05 17:08:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2715 states have (on average 1.796316758747698) internal successors, (4877), 2719 states have internal predecessors, (4877), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:08:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4962 transitions. [2025-02-05 17:08:32,060 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4962 transitions. Word has length 146 [2025-02-05 17:08:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:32,060 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4962 transitions. [2025-02-05 17:08:32,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-02-05 17:08:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4962 transitions. [2025-02-05 17:08:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:32,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:32,068 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] [2025-02-05 17:08:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:08:32,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1378382285, now seen corresponding path program 1 times [2025-02-05 17:08:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:32,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173471307] [2025-02-05 17:08:32,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:32,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:32,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:32,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:32,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173471307] [2025-02-05 17:08:32,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173471307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:32,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:32,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809068584] [2025-02-05 17:08:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:32,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:32,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:32,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:32,289 INFO L87 Difference]: Start difference. First operand 2773 states and 4962 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:32,657 INFO L93 Difference]: Finished difference Result 3468 states and 6055 transitions. [2025-02-05 17:08:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:32,672 INFO L225 Difference]: With dead ends: 3468 [2025-02-05 17:08:32,673 INFO L226 Difference]: Without dead ends: 2833 [2025-02-05 17:08:32,676 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-02-05 17:08:32,677 INFO L435 NwaCegarLoop]: 4344 mSDtfsCounter, 4627 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 12903 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 12903 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:08:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2025-02-05 17:08:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2773. [2025-02-05 17:08:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2715 states have (on average 1.7955801104972375) internal successors, (4875), 2719 states have internal predecessors, (4875), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:08:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4960 transitions. [2025-02-05 17:08:32,761 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4960 transitions. Word has length 146 [2025-02-05 17:08:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:32,761 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4960 transitions. [2025-02-05 17:08:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4960 transitions. [2025-02-05 17:08:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:32,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:32,763 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] [2025-02-05 17:08:32,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:08:32,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:32,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1122399666, now seen corresponding path program 1 times [2025-02-05 17:08:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031095960] [2025-02-05 17:08:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:32,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:32,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:32,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:32,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031095960] [2025-02-05 17:08:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031095960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616767549] [2025-02-05 17:08:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:32,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:32,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:32,974 INFO L87 Difference]: Start difference. First operand 2773 states and 4960 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:33,641 INFO L93 Difference]: Finished difference Result 3810 states and 6579 transitions. [2025-02-05 17:08:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:33,654 INFO L225 Difference]: With dead ends: 3810 [2025-02-05 17:08:33,654 INFO L226 Difference]: Without dead ends: 3175 [2025-02-05 17:08:33,658 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-02-05 17:08:33,659 INFO L435 NwaCegarLoop]: 4629 mSDtfsCounter, 4883 mSDsluCounter, 13936 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4900 SdHoareTripleChecker+Valid, 18565 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:33,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4900 Valid, 18565 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-02-05 17:08:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3074. [2025-02-05 17:08:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2991 states have (on average 1.7696422601136743) internal successors, (5293), 2996 states have internal predecessors, (5293), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:08:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 5417 transitions. [2025-02-05 17:08:33,745 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 5417 transitions. Word has length 146 [2025-02-05 17:08:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:33,745 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 5417 transitions. [2025-02-05 17:08:33,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 5417 transitions. [2025-02-05 17:08:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:33,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:33,748 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] [2025-02-05 17:08:33,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:08:33,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash -648880723, now seen corresponding path program 1 times [2025-02-05 17:08:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348142114] [2025-02-05 17:08:33,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:33,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348142114] [2025-02-05 17:08:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348142114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80094397] [2025-02-05 17:08:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:33,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:33,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:33,923 INFO L87 Difference]: Start difference. First operand 3074 states and 5417 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:34,583 INFO L93 Difference]: Finished difference Result 4754 states and 8031 transitions. [2025-02-05 17:08:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:34,600 INFO L225 Difference]: With dead ends: 4754 [2025-02-05 17:08:34,600 INFO L226 Difference]: Without dead ends: 3818 [2025-02-05 17:08:34,605 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-02-05 17:08:34,607 INFO L435 NwaCegarLoop]: 4621 mSDtfsCounter, 4875 mSDsluCounter, 13914 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 18535 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:34,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 18535 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2025-02-05 17:08:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3708. [2025-02-05 17:08:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3573 states have (on average 1.7313182199832073) internal successors, (6186), 3582 states have internal predecessors, (6186), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:08:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 6394 transitions. [2025-02-05 17:08:34,738 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 6394 transitions. Word has length 146 [2025-02-05 17:08:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:34,738 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 6394 transitions. [2025-02-05 17:08:34,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 6394 transitions. [2025-02-05 17:08:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:34,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:34,742 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] [2025-02-05 17:08:34,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:08:34,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:34,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash 473398476, now seen corresponding path program 1 times [2025-02-05 17:08:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771780912] [2025-02-05 17:08:34,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:34,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:34,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:34,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:34,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771780912] [2025-02-05 17:08:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771780912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:34,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:34,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248158583] [2025-02-05 17:08:34,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:34,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:34,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:34,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:34,888 INFO L87 Difference]: Start difference. First operand 3708 states and 6394 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:35,590 INFO L93 Difference]: Finished difference Result 6776 states and 11206 transitions. [2025-02-05 17:08:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:35,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:35,611 INFO L225 Difference]: With dead ends: 6776 [2025-02-05 17:08:35,611 INFO L226 Difference]: Without dead ends: 5206 [2025-02-05 17:08:35,617 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-02-05 17:08:35,619 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 4870 mSDsluCounter, 13905 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 18523 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:35,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 18523 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-02-05 17:08:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5069. [2025-02-05 17:08:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4824 states have (on average 1.6869817578772803) internal successors, (8138), 4847 states have internal predecessors, (8138), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:08:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8538 transitions. [2025-02-05 17:08:35,818 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8538 transitions. Word has length 146 [2025-02-05 17:08:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:35,819 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8538 transitions. [2025-02-05 17:08:35,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8538 transitions. [2025-02-05 17:08:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:35,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:35,824 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] [2025-02-05 17:08:35,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:08:35,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:35,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1430061619, now seen corresponding path program 1 times [2025-02-05 17:08:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446480048] [2025-02-05 17:08:35,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:35,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446480048] [2025-02-05 17:08:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446480048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:35,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:35,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212936155] [2025-02-05 17:08:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:35,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:35,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:35,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:35,937 INFO L87 Difference]: Start difference. First operand 5069 states and 8538 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:36,542 INFO L93 Difference]: Finished difference Result 11173 states and 18304 transitions. [2025-02-05 17:08:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:36,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:36,571 INFO L225 Difference]: With dead ends: 11173 [2025-02-05 17:08:36,571 INFO L226 Difference]: Without dead ends: 8242 [2025-02-05 17:08:36,581 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-02-05 17:08:36,581 INFO L435 NwaCegarLoop]: 4615 mSDtfsCounter, 4865 mSDsluCounter, 13896 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 18511 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:36,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4882 Valid, 18511 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8242 states. [2025-02-05 17:08:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8242 to 8052. [2025-02-05 17:08:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6522658211124324) internal successors, (12506), 7638 states have internal predecessors, (12506), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:08:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13386 transitions. [2025-02-05 17:08:36,757 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13386 transitions. Word has length 146 [2025-02-05 17:08:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:36,758 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13386 transitions. [2025-02-05 17:08:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13386 transitions. [2025-02-05 17:08:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:36,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:36,762 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] [2025-02-05 17:08:36,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:08:36,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:36,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash 171104428, now seen corresponding path program 1 times [2025-02-05 17:08:36,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:36,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016767516] [2025-02-05 17:08:36,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:36,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:36,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:36,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:36,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016767516] [2025-02-05 17:08:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016767516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:36,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942842622] [2025-02-05 17:08:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:36,862 INFO L87 Difference]: Start difference. First operand 8052 states and 13386 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:37,223 INFO L93 Difference]: Finished difference Result 15128 states and 25152 transitions. [2025-02-05 17:08:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:37,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:37,263 INFO L225 Difference]: With dead ends: 15128 [2025-02-05 17:08:37,263 INFO L226 Difference]: Without dead ends: 9214 [2025-02-05 17:08:37,281 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-02-05 17:08:37,282 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4619 mSDsluCounter, 8534 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4636 SdHoareTripleChecker+Valid, 12865 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:37,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4636 Valid, 12865 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9214 states. [2025-02-05 17:08:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9214 to 8052. [2025-02-05 17:08:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6500198176773682) internal successors, (12489), 7638 states have internal predecessors, (12489), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:08:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13369 transitions. [2025-02-05 17:08:37,582 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13369 transitions. Word has length 146 [2025-02-05 17:08:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13369 transitions. [2025-02-05 17:08:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13369 transitions. [2025-02-05 17:08:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:37,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:37,587 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] [2025-02-05 17:08:37,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:08:37,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:37,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash -469981715, now seen corresponding path program 1 times [2025-02-05 17:08:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690341142] [2025-02-05 17:08:37,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:37,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:37,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:37,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:37,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690341142] [2025-02-05 17:08:37,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690341142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:37,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:37,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830404947] [2025-02-05 17:08:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:37,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:37,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:37,677 INFO L87 Difference]: Start difference. First operand 8052 states and 13369 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:38,044 INFO L93 Difference]: Finished difference Result 15045 states and 24952 transitions. [2025-02-05 17:08:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:38,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:38,071 INFO L225 Difference]: With dead ends: 15045 [2025-02-05 17:08:38,072 INFO L226 Difference]: Without dead ends: 9131 [2025-02-05 17:08:38,087 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-02-05 17:08:38,088 INFO L435 NwaCegarLoop]: 4328 mSDtfsCounter, 4616 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 12857 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:38,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 12857 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2025-02-05 17:08:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 8052. [2025-02-05 17:08:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6477738142423042) internal successors, (12472), 7638 states have internal predecessors, (12472), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:08:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13352 transitions. [2025-02-05 17:08:38,277 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13352 transitions. Word has length 146 [2025-02-05 17:08:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:38,278 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13352 transitions. [2025-02-05 17:08:38,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13352 transitions. [2025-02-05 17:08:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:38,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:38,281 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] [2025-02-05 17:08:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:08:38,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 756264076, now seen corresponding path program 1 times [2025-02-05 17:08:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101059440] [2025-02-05 17:08:38,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:38,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:38,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:38,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:38,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:38,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101059440] [2025-02-05 17:08:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101059440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:38,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:38,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566437045] [2025-02-05 17:08:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:38,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:38,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:38,372 INFO L87 Difference]: Start difference. First operand 8052 states and 13352 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:39,146 INFO L93 Difference]: Finished difference Result 20752 states and 34220 transitions. [2025-02-05 17:08:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:39,189 INFO L225 Difference]: With dead ends: 20752 [2025-02-05 17:08:39,190 INFO L226 Difference]: Without dead ends: 14838 [2025-02-05 17:08:39,205 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-02-05 17:08:39,206 INFO L435 NwaCegarLoop]: 4602 mSDtfsCounter, 4844 mSDsluCounter, 13859 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4861 SdHoareTripleChecker+Valid, 18461 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:39,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4861 Valid, 18461 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14838 states. [2025-02-05 17:08:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14838 to 14585. [2025-02-05 17:08:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14585 states, 13572 states have (on average 1.6312997347480107) internal successors, (22140), 13787 states have internal predecessors, (22140), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:08:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14585 states to 14585 states and 24364 transitions. [2025-02-05 17:08:39,539 INFO L78 Accepts]: Start accepts. Automaton has 14585 states and 24364 transitions. Word has length 146 [2025-02-05 17:08:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:39,539 INFO L471 AbstractCegarLoop]: Abstraction has 14585 states and 24364 transitions. [2025-02-05 17:08:39,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14585 states and 24364 transitions. [2025-02-05 17:08:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:39,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:39,545 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] [2025-02-05 17:08:39,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:08:39,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:39,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2042746381, now seen corresponding path program 1 times [2025-02-05 17:08:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040732612] [2025-02-05 17:08:39,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:39,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:39,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:39,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:39,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:39,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040732612] [2025-02-05 17:08:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040732612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:39,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246276014] [2025-02-05 17:08:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:39,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:39,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:39,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:39,641 INFO L87 Difference]: Start difference. First operand 14585 states and 24364 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:41,004 INFO L93 Difference]: Finished difference Result 44385 states and 75335 transitions. [2025-02-05 17:08:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:41,120 INFO L225 Difference]: With dead ends: 44385 [2025-02-05 17:08:41,120 INFO L226 Difference]: Without dead ends: 31938 [2025-02-05 17:08:41,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:08:41,164 INFO L435 NwaCegarLoop]: 4597 mSDtfsCounter, 5123 mSDsluCounter, 13839 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 18436 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:41,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 18436 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31938 states. [2025-02-05 17:08:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31938 to 29256. [2025-02-05 17:08:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29256 states, 27053 states have (on average 1.63796991091561) internal successors, (44312), 27722 states have internal predecessors, (44312), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-02-05 17:08:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29256 states to 29256 states and 50696 transitions. [2025-02-05 17:08:42,073 INFO L78 Accepts]: Start accepts. Automaton has 29256 states and 50696 transitions. Word has length 146 [2025-02-05 17:08:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 29256 states and 50696 transitions. [2025-02-05 17:08:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29256 states and 50696 transitions. [2025-02-05 17:08:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:42,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:42,083 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] [2025-02-05 17:08:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:08:42,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -271058836, now seen corresponding path program 1 times [2025-02-05 17:08:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716236604] [2025-02-05 17:08:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:42,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:42,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:42,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:42,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716236604] [2025-02-05 17:08:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716236604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:42,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:08:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258750950] [2025-02-05 17:08:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:42,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:08:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:42,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:08:42,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:08:42,184 INFO L87 Difference]: Start difference. First operand 29256 states and 50696 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:44,035 INFO L93 Difference]: Finished difference Result 93784 states and 169213 transitions. [2025-02-05 17:08:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:08:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:44,300 INFO L225 Difference]: With dead ends: 93784 [2025-02-05 17:08:44,300 INFO L226 Difference]: Without dead ends: 66666 [2025-02-05 17:08:44,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:08:44,366 INFO L435 NwaCegarLoop]: 4590 mSDtfsCounter, 5055 mSDsluCounter, 13820 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 18410 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:44,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 18410 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:08:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66666 states. [2025-02-05 17:08:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66666 to 62390. [2025-02-05 17:08:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6542813802242253) internal successors, (94878), 59416 states have internal predecessors, (94878), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:08:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115662 transitions. [2025-02-05 17:08:47,514 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115662 transitions. Word has length 146 [2025-02-05 17:08:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:47,516 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115662 transitions. [2025-02-05 17:08:47,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115662 transitions. [2025-02-05 17:08:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:47,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:47,533 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] [2025-02-05 17:08:47,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:08:47,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1417599349, now seen corresponding path program 1 times [2025-02-05 17:08:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:47,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626324654] [2025-02-05 17:08:47,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:47,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:47,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:47,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626324654] [2025-02-05 17:08:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626324654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:47,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789347089] [2025-02-05 17:08:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:47,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:47,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:47,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:47,878 INFO L87 Difference]: Start difference. First operand 62390 states and 115662 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:50,516 INFO L93 Difference]: Finished difference Result 140154 states and 272438 transitions. [2025-02-05 17:08:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:50,948 INFO L225 Difference]: With dead ends: 140154 [2025-02-05 17:08:50,948 INFO L226 Difference]: Without dead ends: 79902 [2025-02-05 17:08:51,139 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-02-05 17:08:51,139 INFO L435 NwaCegarLoop]: 4317 mSDtfsCounter, 4607 mSDsluCounter, 8506 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 12823 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:51,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 12823 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79902 states. [2025-02-05 17:08:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79902 to 62390. [2025-02-05 17:08:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6520321517618957) internal successors, (94749), 59416 states have internal predecessors, (94749), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:08:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115533 transitions. [2025-02-05 17:08:54,668 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115533 transitions. Word has length 146 [2025-02-05 17:08:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:08:54,670 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115533 transitions. [2025-02-05 17:08:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115533 transitions. [2025-02-05 17:08:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:08:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:08:54,688 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] [2025-02-05 17:08:54,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:08:54,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:08:54,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:08:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1593456780, now seen corresponding path program 1 times [2025-02-05 17:08:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:08:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055431491] [2025-02-05 17:08:54,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:08:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:08:54,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:08:54,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:08:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:08:54,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:08:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:08:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:08:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055431491] [2025-02-05 17:08:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055431491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:08:54,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:08:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:08:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769835833] [2025-02-05 17:08:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:08:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:08:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:08:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:08:54,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:08:54,779 INFO L87 Difference]: Start difference. First operand 62390 states and 115533 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:08:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:08:58,143 INFO L93 Difference]: Finished difference Result 137965 states and 267802 transitions. [2025-02-05 17:08:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:08:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:08:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:08:58,594 INFO L225 Difference]: With dead ends: 137965 [2025-02-05 17:08:58,595 INFO L226 Difference]: Without dead ends: 77713 [2025-02-05 17:08:58,769 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-02-05 17:08:58,770 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4604 mSDsluCounter, 8501 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 12815 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:08:58,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 12815 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:08:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77713 states. [2025-02-05 17:09:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77713 to 62390. [2025-02-05 17:09:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6497829232995658) internal successors, (94620), 59416 states have internal predecessors, (94620), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:09:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115404 transitions. [2025-02-05 17:09:01,941 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115404 transitions. Word has length 146 [2025-02-05 17:09:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:01,942 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115404 transitions. [2025-02-05 17:09:01,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:09:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115404 transitions. [2025-02-05 17:09:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:09:01,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:01,957 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] [2025-02-05 17:09:01,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:09:01,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:01,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1829134955, now seen corresponding path program 1 times [2025-02-05 17:09:01,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379229280] [2025-02-05 17:09:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:01,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:09:01,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:09:01,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:01,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:09:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379229280] [2025-02-05 17:09:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379229280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102534562] [2025-02-05 17:09:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:02,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:02,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:02,048 INFO L87 Difference]: Start difference. First operand 62390 states and 115404 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:09:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:07,612 INFO L93 Difference]: Finished difference Result 200698 states and 398403 transitions. [2025-02-05 17:09:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:07,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2025-02-05 17:09:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:08,358 INFO L225 Difference]: With dead ends: 200698 [2025-02-05 17:09:08,359 INFO L226 Difference]: Without dead ends: 140446 [2025-02-05 17:09:08,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:09:08,524 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 4944 mSDsluCounter, 13783 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4971 SdHoareTripleChecker+Valid, 18360 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:08,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4971 Valid, 18360 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:09:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140446 states. [2025-02-05 17:09:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140446 to 135027. [2025-02-05 17:09:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135027 states, 122928 states have (on average 1.6599310165300012) internal successors, (204052), 129237 states have internal predecessors, (204052), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 7848 states have return successors, (69783), 4502 states have call predecessors, (69783), 4247 states have call successors, (69783) [2025-02-05 17:09:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135027 states to 135027 states and 278084 transitions. [2025-02-05 17:09:16,678 INFO L78 Accepts]: Start accepts. Automaton has 135027 states and 278084 transitions. Word has length 146 [2025-02-05 17:09:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 135027 states and 278084 transitions. [2025-02-05 17:09:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-02-05 17:09:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 135027 states and 278084 transitions. [2025-02-05 17:09:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:09:16,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:16,933 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] [2025-02-05 17:09:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:09:16,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1005453484, now seen corresponding path program 1 times [2025-02-05 17:09:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888492788] [2025-02-05 17:09:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:16,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:09:16,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:09:16,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:16,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:09:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888492788] [2025-02-05 17:09:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888492788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330573308] [2025-02-05 17:09:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:17,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:17,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:17,017 INFO L87 Difference]: Start difference. First operand 135027 states and 278084 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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)