./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.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_label49+token_ring.10.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 350eaf2863f602bf9d6d43c31d190808a06f274c6c222054e38d4c11a80535eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:19:28,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:19:28,556 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:19:28,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:19:28,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:19:28,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:19:28,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:19:28,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:19:28,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:19:28,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:19:28,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:19:28,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:19:28,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:19:28,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:19:28,574 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:19:28,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:19:28,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:19:28,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:19:28,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:19:28,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:19:28,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:19:28,577 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 -> 350eaf2863f602bf9d6d43c31d190808a06f274c6c222054e38d4c11a80535eb [2025-02-05 17:19:28,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:19:28,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:19:28,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:19:28,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:19:28,749 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:19:28,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c [2025-02-05 17:19:29,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1ec6699/d9cbe99d6378401aaf02ff92ab3bed67/FLAG6730fd805 [2025-02-05 17:19:30,563 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:19:30,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c [2025-02-05 17:19:30,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1ec6699/d9cbe99d6378401aaf02ff92ab3bed67/FLAG6730fd805 [2025-02-05 17:19:31,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1ec6699/d9cbe99d6378401aaf02ff92ab3bed67 [2025-02-05 17:19:31,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:19:31,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:19:31,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:19:31,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:19:31,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:19:31,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:19:31" (1/1) ... [2025-02-05 17:19:31,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5165150d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:31, skipping insertion in model container [2025-02-05 17:19:31,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:19:31" (1/1) ... [2025-02-05 17:19:31,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:19:32,285 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_label49+token_ring.10.cil-1.c[380593,380606] [2025-02-05 17:19:32,310 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_label49+token_ring.10.cil-1.c[383339,383352] [2025-02-05 17:19:32,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:19:32,544 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:19:33,014 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_label49+token_ring.10.cil-1.c[380593,380606] [2025-02-05 17:19:33,018 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_label49+token_ring.10.cil-1.c[383339,383352] [2025-02-05 17:19:33,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:19:33,100 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:19:33,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33 WrapperNode [2025-02-05 17:19:33,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:19:33,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:19:33,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:19:33,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:19:33,107 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:19:33" (1/1) ... [2025-02-05 17:19:33,161 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:19:33" (1/1) ... [2025-02-05 17:19:33,586 INFO L138 Inliner]: procedures = 64, calls = 72, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 13077 [2025-02-05 17:19:33,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:19:33,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:19:33,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:19:33,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:19:33,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,739 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:19:33,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:19:33,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:19:33,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:19:33,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:19:33,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (1/1) ... [2025-02-05 17:19:33,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:19:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:33,946 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:19:33,957 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:19:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:19:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:19:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:19:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:19:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:19:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:19:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:19:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:19:34,052 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:19:34,054 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:19:39,915 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:19:39,916 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:19:39,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:19:39,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:19:39,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:19:39,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:19:39,918 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:19:40,160 INFO L? ?]: Removed 1747 outVars from TransFormulas that were not future-live. [2025-02-05 17:19:40,161 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:19:40,222 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:19:40,222 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:19:40,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:19:40 BoogieIcfgContainer [2025-02-05 17:19:40,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:19:40,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:19:40,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:19:40,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:19:40,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:19:31" (1/3) ... [2025-02-05 17:19:40,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ee1e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:19:40, skipping insertion in model container [2025-02-05 17:19:40,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:33" (2/3) ... [2025-02-05 17:19:40,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ee1e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:19:40, skipping insertion in model container [2025-02-05 17:19:40,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:19:40" (3/3) ... [2025-02-05 17:19:40,236 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.10.cil-1.c [2025-02-05 17:19:40,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:19:40,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.10.cil-1.c that has 8 procedures, 2545 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:19:40,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:19:40,350 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;@44d2d522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:19:40,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:19:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 2545 states, 2509 states have (on average 1.8330011956954961) internal successors, (4599), 2514 states have internal predecessors, (4599), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:19:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:40,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:40,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:40,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:40,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1101016533, now seen corresponding path program 1 times [2025-02-05 17:19:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057688139] [2025-02-05 17:19:40,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:40,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:40,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:40,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:40,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:40,854 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:19:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057688139] [2025-02-05 17:19:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057688139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89231012] [2025-02-05 17:19:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:40,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:40,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:40,902 INFO L87 Difference]: Start difference. First operand has 2545 states, 2509 states have (on average 1.8330011956954961) internal successors, (4599), 2514 states have internal predecessors, (4599), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:19:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:41,545 INFO L93 Difference]: Finished difference Result 5452 states and 9887 transitions. [2025-02-05 17:19:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:19:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:41,576 INFO L225 Difference]: With dead ends: 5452 [2025-02-05 17:19:41,576 INFO L226 Difference]: Without dead ends: 2855 [2025-02-05 17:19:41,587 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:19:41,590 INFO L435 NwaCegarLoop]: 4459 mSDtfsCounter, 5042 mSDsluCounter, 9168 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 13627 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:41,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 13627 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2025-02-05 17:19:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2828. [2025-02-05 17:19:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2768 states have (on average 1.7922687861271676) internal successors, (4961), 2772 states have internal predecessors, (4961), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:19:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 5050 transitions. [2025-02-05 17:19:41,726 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 5050 transitions. Word has length 157 [2025-02-05 17:19:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 5050 transitions. [2025-02-05 17:19:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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:19:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 5050 transitions. [2025-02-05 17:19:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:41,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:41,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:41,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:19:41,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:41,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -713449517, now seen corresponding path program 1 times [2025-02-05 17:19:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:41,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381828609] [2025-02-05 17:19:41,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:41,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:41,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:41,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:42,048 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:19:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381828609] [2025-02-05 17:19:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381828609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540791248] [2025-02-05 17:19:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:42,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:42,054 INFO L87 Difference]: Start difference. First operand 2828 states and 5050 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:42,400 INFO L93 Difference]: Finished difference Result 3583 states and 6241 transitions. [2025-02-05 17:19:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:42,411 INFO L225 Difference]: With dead ends: 3583 [2025-02-05 17:19:42,412 INFO L226 Difference]: Without dead ends: 2894 [2025-02-05 17:19:42,414 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:19:42,414 INFO L435 NwaCegarLoop]: 4378 mSDtfsCounter, 4688 mSDsluCounter, 8617 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 12995 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:42,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 12995 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2025-02-05 17:19:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2828. [2025-02-05 17:19:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2768 states have (on average 1.7915462427745665) internal successors, (4959), 2772 states have internal predecessors, (4959), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-02-05 17:19:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 5048 transitions. [2025-02-05 17:19:42,493 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 5048 transitions. Word has length 157 [2025-02-05 17:19:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:42,493 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 5048 transitions. [2025-02-05 17:19:42,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 5048 transitions. [2025-02-05 17:19:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:42,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:19:42,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2133510932, now seen corresponding path program 1 times [2025-02-05 17:19:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997573836] [2025-02-05 17:19:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:42,755 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:19:42,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997573836] [2025-02-05 17:19:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997573836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:42,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:42,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610496171] [2025-02-05 17:19:42,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:42,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:42,758 INFO L87 Difference]: Start difference. First operand 2828 states and 5048 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:43,582 INFO L93 Difference]: Finished difference Result 3955 states and 6814 transitions. [2025-02-05 17:19:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:43,596 INFO L225 Difference]: With dead ends: 3955 [2025-02-05 17:19:43,596 INFO L226 Difference]: Without dead ends: 3266 [2025-02-05 17:19:43,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:19:43,601 INFO L435 NwaCegarLoop]: 4688 mSDtfsCounter, 4972 mSDsluCounter, 14124 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4990 SdHoareTripleChecker+Valid, 18812 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:43,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4990 Valid, 18812 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:19:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2025-02-05 17:19:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3155. [2025-02-05 17:19:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 3069 states have (on average 1.7647442163571196) internal successors, (5416), 3074 states have internal predecessors, (5416), 64 states have call successors, (64), 19 states have call predecessors, (64), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-02-05 17:19:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 5546 transitions. [2025-02-05 17:19:43,683 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 5546 transitions. Word has length 157 [2025-02-05 17:19:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:43,684 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 5546 transitions. [2025-02-05 17:19:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 5546 transitions. [2025-02-05 17:19:43,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:43,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:43,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:43,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:19:43,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:43,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash -822692941, now seen corresponding path program 1 times [2025-02-05 17:19:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797221231] [2025-02-05 17:19:43,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:43,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:43,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:43,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:43,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:43,838 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:19:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797221231] [2025-02-05 17:19:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797221231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650061982] [2025-02-05 17:19:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:43,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:43,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:43,840 INFO L87 Difference]: Start difference. First operand 3155 states and 5546 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:44,393 INFO L93 Difference]: Finished difference Result 4991 states and 8417 transitions. [2025-02-05 17:19:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:44,407 INFO L225 Difference]: With dead ends: 4991 [2025-02-05 17:19:44,407 INFO L226 Difference]: Without dead ends: 3975 [2025-02-05 17:19:44,410 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:19:44,411 INFO L435 NwaCegarLoop]: 4420 mSDtfsCounter, 4996 mSDsluCounter, 13469 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 17889 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:44,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 17889 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:19:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2025-02-05 17:19:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3848. [2025-02-05 17:19:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3848 states, 3708 states have (on average 1.7262675296655878) internal successors, (6401), 3717 states have internal predecessors, (6401), 102 states have call successors, (102), 31 states have call predecessors, (102), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-02-05 17:19:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 6619 transitions. [2025-02-05 17:19:44,500 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 6619 transitions. Word has length 157 [2025-02-05 17:19:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:44,500 INFO L471 AbstractCegarLoop]: Abstraction has 3848 states and 6619 transitions. [2025-02-05 17:19:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 6619 transitions. [2025-02-05 17:19:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:44,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:44,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:44,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:19:44,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash -640959692, now seen corresponding path program 1 times [2025-02-05 17:19:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:44,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908356014] [2025-02-05 17:19:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:44,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:44,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:44,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:44,623 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:19:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908356014] [2025-02-05 17:19:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908356014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:44,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041315014] [2025-02-05 17:19:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:44,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:44,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:44,625 INFO L87 Difference]: Start difference. First operand 3848 states and 6619 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:45,297 INFO L93 Difference]: Finished difference Result 7214 states and 11928 transitions. [2025-02-05 17:19:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:45,315 INFO L225 Difference]: With dead ends: 7214 [2025-02-05 17:19:45,316 INFO L226 Difference]: Without dead ends: 5505 [2025-02-05 17:19:45,320 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:19:45,320 INFO L435 NwaCegarLoop]: 4681 mSDtfsCounter, 4962 mSDsluCounter, 14103 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4980 SdHoareTripleChecker+Valid, 18784 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:45,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4980 Valid, 18784 Invalid, 997 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2025-02-05 17:19:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 5345. [2025-02-05 17:19:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5345 states, 5091 states have (on average 1.6839520722844235) internal successors, (8573), 5114 states have internal predecessors, (8573), 178 states have call successors, (178), 55 states have call predecessors, (178), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-02-05 17:19:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 8991 transitions. [2025-02-05 17:19:45,433 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 8991 transitions. Word has length 157 [2025-02-05 17:19:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 5345 states and 8991 transitions. [2025-02-05 17:19:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 8991 transitions. [2025-02-05 17:19:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:45,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:45,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:19:45,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -496549997, now seen corresponding path program 1 times [2025-02-05 17:19:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036070416] [2025-02-05 17:19:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:45,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:45,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:45,545 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:19:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036070416] [2025-02-05 17:19:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036070416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331562027] [2025-02-05 17:19:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:45,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:45,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:45,547 INFO L87 Difference]: Start difference. First operand 5345 states and 8991 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:46,185 INFO L93 Difference]: Finished difference Result 12085 states and 19842 transitions. [2025-02-05 17:19:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:46,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:46,226 INFO L225 Difference]: With dead ends: 12085 [2025-02-05 17:19:46,227 INFO L226 Difference]: Without dead ends: 8879 [2025-02-05 17:19:46,238 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:19:46,240 INFO L435 NwaCegarLoop]: 4678 mSDtfsCounter, 4957 mSDsluCounter, 14094 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 18772 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:46,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 18772 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8879 states. [2025-02-05 17:19:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8879 to 8654. [2025-02-05 17:19:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8654 states, 8154 states have (on average 1.654280107922492) internal successors, (13489), 8223 states have internal predecessors, (13489), 330 states have call successors, (330), 103 states have call predecessors, (330), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-02-05 17:19:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8654 states to 8654 states and 14403 transitions. [2025-02-05 17:19:46,445 INFO L78 Accepts]: Start accepts. Automaton has 8654 states and 14403 transitions. Word has length 157 [2025-02-05 17:19:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:46,446 INFO L471 AbstractCegarLoop]: Abstraction has 8654 states and 14403 transitions. [2025-02-05 17:19:46,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states and 14403 transitions. [2025-02-05 17:19:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:46,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:46,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:46,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:19:46,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash -768986284, now seen corresponding path program 1 times [2025-02-05 17:19:46,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:46,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474538570] [2025-02-05 17:19:46,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:46,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:46,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:46,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:46,556 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:19:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474538570] [2025-02-05 17:19:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474538570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:46,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:46,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709477370] [2025-02-05 17:19:46,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:46,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:46,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:46,558 INFO L87 Difference]: Start difference. First operand 8654 states and 14403 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:47,314 INFO L93 Difference]: Finished difference Result 23028 states and 38324 transitions. [2025-02-05 17:19:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:47,359 INFO L225 Difference]: With dead ends: 23028 [2025-02-05 17:19:47,359 INFO L226 Difference]: Without dead ends: 16513 [2025-02-05 17:19:47,379 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:19:47,379 INFO L435 NwaCegarLoop]: 4675 mSDtfsCounter, 4952 mSDsluCounter, 14085 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4970 SdHoareTripleChecker+Valid, 18760 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:47,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4970 Valid, 18760 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16513 states. [2025-02-05 17:19:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16513 to 16163. [2025-02-05 17:19:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16163 states, 15117 states have (on average 1.649335185552689) internal successors, (24933), 15332 states have internal predecessors, (24933), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:19:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16163 states to 16163 states and 27223 transitions. [2025-02-05 17:19:47,725 INFO L78 Accepts]: Start accepts. Automaton has 16163 states and 27223 transitions. Word has length 157 [2025-02-05 17:19:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:47,725 INFO L471 AbstractCegarLoop]: Abstraction has 16163 states and 27223 transitions. [2025-02-05 17:19:47,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 16163 states and 27223 transitions. [2025-02-05 17:19:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:47,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:47,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:47,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:19:47,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:47,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1716077427, now seen corresponding path program 1 times [2025-02-05 17:19:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261382333] [2025-02-05 17:19:47,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:47,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:47,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:47,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:47,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:47,924 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:19:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261382333] [2025-02-05 17:19:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261382333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:47,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:47,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:47,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557318741] [2025-02-05 17:19:47,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:47,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:47,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:47,929 INFO L87 Difference]: Start difference. First operand 16163 states and 27223 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:48,487 INFO L93 Difference]: Finished difference Result 34107 states and 58654 transitions. [2025-02-05 17:19:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:48,542 INFO L225 Difference]: With dead ends: 34107 [2025-02-05 17:19:48,543 INFO L226 Difference]: Without dead ends: 20083 [2025-02-05 17:19:48,578 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:19:48,578 INFO L435 NwaCegarLoop]: 4365 mSDtfsCounter, 4680 mSDsluCounter, 8592 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 12957 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:48,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 12957 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:19:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20083 states. [2025-02-05 17:19:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20083 to 16163. [2025-02-05 17:19:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16163 states, 15117 states have (on average 1.647152212740623) internal successors, (24900), 15332 states have internal predecessors, (24900), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:19:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16163 states to 16163 states and 27190 transitions. [2025-02-05 17:19:49,171 INFO L78 Accepts]: Start accepts. Automaton has 16163 states and 27190 transitions. Word has length 157 [2025-02-05 17:19:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:49,171 INFO L471 AbstractCegarLoop]: Abstraction has 16163 states and 27190 transitions. [2025-02-05 17:19:49,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 16163 states and 27190 transitions. [2025-02-05 17:19:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:49,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:49,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:19:49,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1242051444, now seen corresponding path program 1 times [2025-02-05 17:19:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229676698] [2025-02-05 17:19:49,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:49,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:49,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:49,285 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:19:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229676698] [2025-02-05 17:19:49,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229676698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:49,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:49,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992554821] [2025-02-05 17:19:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:49,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:49,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:49,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:49,288 INFO L87 Difference]: Start difference. First operand 16163 states and 27190 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:49,888 INFO L93 Difference]: Finished difference Result 33862 states and 58098 transitions. [2025-02-05 17:19:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:49,949 INFO L225 Difference]: With dead ends: 33862 [2025-02-05 17:19:49,949 INFO L226 Difference]: Without dead ends: 19838 [2025-02-05 17:19:49,979 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:19:49,983 INFO L435 NwaCegarLoop]: 4362 mSDtfsCounter, 4677 mSDsluCounter, 8587 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 12949 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:49,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 12949 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19838 states. [2025-02-05 17:19:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19838 to 16163. [2025-02-05 17:19:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16163 states, 15117 states have (on average 1.6449692399285571) internal successors, (24867), 15332 states have internal predecessors, (24867), 634 states have call successors, (634), 199 states have call predecessors, (634), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-02-05 17:19:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16163 states to 16163 states and 27157 transitions. [2025-02-05 17:19:50,442 INFO L78 Accepts]: Start accepts. Automaton has 16163 states and 27157 transitions. Word has length 157 [2025-02-05 17:19:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:50,443 INFO L471 AbstractCegarLoop]: Abstraction has 16163 states and 27157 transitions. [2025-02-05 17:19:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 16163 states and 27157 transitions. [2025-02-05 17:19:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:50,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:50,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:50,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:19:50,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash 949665619, now seen corresponding path program 1 times [2025-02-05 17:19:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73938148] [2025-02-05 17:19:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:50,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:50,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:50,557 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:19:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73938148] [2025-02-05 17:19:50,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73938148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:50,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:50,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54657341] [2025-02-05 17:19:50,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:50,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:50,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:50,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:50,559 INFO L87 Difference]: Start difference. First operand 16163 states and 27157 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:51,616 INFO L93 Difference]: Finished difference Result 47747 states and 82004 transitions. [2025-02-05 17:19:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:51,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:51,717 INFO L225 Difference]: With dead ends: 47747 [2025-02-05 17:19:51,717 INFO L226 Difference]: Without dead ends: 33723 [2025-02-05 17:19:51,750 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:19:51,750 INFO L435 NwaCegarLoop]: 4662 mSDtfsCounter, 4931 mSDsluCounter, 14048 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4949 SdHoareTripleChecker+Valid, 18710 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:51,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4949 Valid, 18710 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33723 states. [2025-02-05 17:19:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33723 to 33206. [2025-02-05 17:19:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33206 states, 30906 states have (on average 1.657898142755452) internal successors, (51239), 31575 states have internal predecessors, (51239), 1242 states have call successors, (1242), 391 states have call predecessors, (1242), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:19:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33206 states to 33206 states and 57817 transitions. [2025-02-05 17:19:52,661 INFO L78 Accepts]: Start accepts. Automaton has 33206 states and 57817 transitions. Word has length 157 [2025-02-05 17:19:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:52,662 INFO L471 AbstractCegarLoop]: Abstraction has 33206 states and 57817 transitions. [2025-02-05 17:19:52,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33206 states and 57817 transitions. [2025-02-05 17:19:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:52,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:52,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:19:52,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1415070828, now seen corresponding path program 1 times [2025-02-05 17:19:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913943585] [2025-02-05 17:19:52,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:52,752 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:19:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913943585] [2025-02-05 17:19:52,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913943585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:52,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:52,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:52,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676092470] [2025-02-05 17:19:52,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:52,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:52,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:52,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:52,754 INFO L87 Difference]: Start difference. First operand 33206 states and 57817 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:54,272 INFO L93 Difference]: Finished difference Result 73776 states and 132686 transitions. [2025-02-05 17:19:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:54,415 INFO L225 Difference]: With dead ends: 73776 [2025-02-05 17:19:54,415 INFO L226 Difference]: Without dead ends: 42709 [2025-02-05 17:19:54,506 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:19:54,507 INFO L435 NwaCegarLoop]: 4357 mSDtfsCounter, 4673 mSDsluCounter, 8578 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 12935 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:54,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 12935 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42709 states. [2025-02-05 17:19:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42709 to 33206. [2025-02-05 17:19:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33206 states, 30906 states have (on average 1.6557949912638323) internal successors, (51174), 31575 states have internal predecessors, (51174), 1242 states have call successors, (1242), 391 states have call predecessors, (1242), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-02-05 17:19:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33206 states to 33206 states and 57752 transitions. [2025-02-05 17:19:55,913 INFO L78 Accepts]: Start accepts. Automaton has 33206 states and 57752 transitions. Word has length 157 [2025-02-05 17:19:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:55,914 INFO L471 AbstractCegarLoop]: Abstraction has 33206 states and 57752 transitions. [2025-02-05 17:19:55,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:19:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33206 states and 57752 transitions. [2025-02-05 17:19:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:19:55,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:55,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:19:55,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:55,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1629899981, now seen corresponding path program 1 times [2025-02-05 17:19:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477480446] [2025-02-05 17:19:55,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:55,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:19:55,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:19:55,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:55,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:56,019 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:19:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477480446] [2025-02-05 17:19:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477480446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130218252] [2025-02-05 17:19:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:56,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:56,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:56,021 INFO L87 Difference]: Start difference. First operand 33206 states and 57752 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:19:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:58,767 INFO L93 Difference]: Finished difference Result 109336 states and 197124 transitions. [2025-02-05 17:19:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:58,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:19:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:59,133 INFO L225 Difference]: With dead ends: 109336 [2025-02-05 17:19:59,133 INFO L226 Difference]: Without dead ends: 78269 [2025-02-05 17:19:59,233 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:19:59,234 INFO L435 NwaCegarLoop]: 4402 mSDtfsCounter, 5272 mSDsluCounter, 13403 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 17805 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:59,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 17805 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78269 states. [2025-02-05 17:20:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78269 to 72446. [2025-02-05 17:20:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72446 states, 67216 states have (on average 1.6800761723399191) internal successors, (112928), 69279 states have internal predecessors, (112928), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:20:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72446 states to 72446 states and 134098 transitions. [2025-02-05 17:20:02,293 INFO L78 Accepts]: Start accepts. Automaton has 72446 states and 134098 transitions. Word has length 157 [2025-02-05 17:20:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:02,294 INFO L471 AbstractCegarLoop]: Abstraction has 72446 states and 134098 transitions. [2025-02-05 17:20:02,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:20:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 72446 states and 134098 transitions. [2025-02-05 17:20:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:20:02,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:02,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:20:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:20:02,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 164285364, now seen corresponding path program 1 times [2025-02-05 17:20:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683527865] [2025-02-05 17:20:02,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:02,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:20:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:20:02,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:02,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:02,380 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:20:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:02,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683527865] [2025-02-05 17:20:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683527865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:02,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:02,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082800111] [2025-02-05 17:20:02,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:02,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:02,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:02,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:02,382 INFO L87 Difference]: Start difference. First operand 72446 states and 134098 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:20:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:05,579 INFO L93 Difference]: Finished difference Result 166832 states and 322442 transitions. [2025-02-05 17:20:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:20:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:05,942 INFO L225 Difference]: With dead ends: 166832 [2025-02-05 17:20:05,943 INFO L226 Difference]: Without dead ends: 96525 [2025-02-05 17:20:06,112 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:20:06,113 INFO L435 NwaCegarLoop]: 4352 mSDtfsCounter, 4667 mSDsluCounter, 8567 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12919 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:06,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 12919 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:20:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96525 states. [2025-02-05 17:20:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96525 to 72446. [2025-02-05 17:20:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72446 states, 67216 states have (on average 1.678156986431802) internal successors, (112799), 69279 states have internal predecessors, (112799), 2394 states have call successors, (2394), 775 states have call predecessors, (2394), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-02-05 17:20:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72446 states to 72446 states and 133969 transitions. [2025-02-05 17:20:10,228 INFO L78 Accepts]: Start accepts. Automaton has 72446 states and 133969 transitions. Word has length 157 [2025-02-05 17:20:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:10,228 INFO L471 AbstractCegarLoop]: Abstraction has 72446 states and 133969 transitions. [2025-02-05 17:20:10,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:20:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 72446 states and 133969 transitions. [2025-02-05 17:20:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:20:10,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:10,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:20:10,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:20:10,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:10,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 637804307, now seen corresponding path program 1 times [2025-02-05 17:20:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522693503] [2025-02-05 17:20:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:10,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:20:10,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:20:10,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:10,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:10,766 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:20:10,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:10,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522693503] [2025-02-05 17:20:10,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522693503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:10,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:10,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:10,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756298774] [2025-02-05 17:20:10,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:10,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:10,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:10,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:10,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:10,772 INFO L87 Difference]: Start difference. First operand 72446 states and 133969 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:20:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:16,408 INFO L93 Difference]: Finished difference Result 243692 states and 477905 transitions. [2025-02-05 17:20:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-02-05 17:20:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:17,194 INFO L225 Difference]: With dead ends: 243692 [2025-02-05 17:20:17,194 INFO L226 Difference]: Without dead ends: 173385 [2025-02-05 17:20:17,446 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:20:17,446 INFO L435 NwaCegarLoop]: 4644 mSDtfsCounter, 5159 mSDsluCounter, 13991 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5188 SdHoareTripleChecker+Valid, 18635 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:17,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5188 Valid, 18635 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:20:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2025-02-05 17:20:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 163856. [2025-02-05 17:20:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163856 states, 151372 states have (on average 1.7034656343313161) internal successors, (257857), 157681 states have internal predecessors, (257857), 4634 states have call successors, (4634), 1543 states have call predecessors, (4634), 7848 states have return successors, (70168), 4887 states have call predecessors, (70168), 4632 states have call successors, (70168) [2025-02-05 17:20:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163856 states to 163856 states and 332659 transitions. [2025-02-05 17:20:28,620 INFO L78 Accepts]: Start accepts. Automaton has 163856 states and 332659 transitions. Word has length 157 [2025-02-05 17:20:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 163856 states and 332659 transitions. [2025-02-05 17:20:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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:20:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 163856 states and 332659 transitions. [2025-02-05 17:20:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 17:20:28,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:28,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:20:28,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:20:28,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:28,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1068721108, now seen corresponding path program 1 times [2025-02-05 17:20:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798184404] [2025-02-05 17:20:28,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:28,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 17:20:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 17:20:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:28,803 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:20:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798184404] [2025-02-05 17:20:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798184404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581033265] [2025-02-05 17:20:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:28,805 INFO L87 Difference]: Start difference. First operand 163856 states and 332659 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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)