./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 22315e954f625a92454f179210263631b555d33fa4f07d11e85c64617a347172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:48:14,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:48:14,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:48:14,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:48:14,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:48:14,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:48:14,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:48:14,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:48:14,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:48:14,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:48:14,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:48:14,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:48:14,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:48:14,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:48:14,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:48:14,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:48:14,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:48:14,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:48:14,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:48:14,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:14,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:48:14,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:48:14,608 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/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 -> 22315e954f625a92454f179210263631b555d33fa4f07d11e85c64617a347172 [2025-03-03 15:48:14,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:48:14,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:48:14,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:48:14,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:48:14,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:48:14,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c [2025-03-03 15:48:16,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966a5f675/488ce37112064bfc8e7352346aa7de16/FLAG8a791ebe6 [2025-03-03 15:48:16,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:48:16,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c [2025-03-03 15:48:16,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966a5f675/488ce37112064bfc8e7352346aa7de16/FLAG8a791ebe6 [2025-03-03 15:48:16,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966a5f675/488ce37112064bfc8e7352346aa7de16 [2025-03-03 15:48:16,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:48:16,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:48:16,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:16,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:48:16,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:48:16,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:16" (1/1) ... [2025-03-03 15:48:16,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3024c235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:16, skipping insertion in model container [2025-03-03 15:48:16,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:16" (1/1) ... [2025-03-03 15:48:16,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:48:17,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c[380593,380606] [2025-03-03 15:48:17,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c[383339,383352] [2025-03-03 15:48:18,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:18,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:48:18,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c[380593,380606] [2025-03-03 15:48:18,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-2.c[383339,383352] [2025-03-03 15:48:18,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:18,839 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:48:18,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18 WrapperNode [2025-03-03 15:48:18,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:18,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:18,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:48:18,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:48:18,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:18,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,153 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12792 [2025-03-03 15:48:19,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:19,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:48:19,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:48:19,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:48:19,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,334 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-03-03 15:48:19,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:48:19,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:48:19,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:48:19,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:48:19,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (1/1) ... [2025-03-03 15:48:19,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:19,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:48:19,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:48:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:48:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:48:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:48:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:48:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:48:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:48:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:48:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:48:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:48:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:48:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:48:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:48:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:48:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:48:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:48:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:48:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:48:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:48:19,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:48:19,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:48:26,033 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:48:26,033 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:48:26,034 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:48:26,034 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:48:26,034 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:48:26,035 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:48:26,035 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:48:26,233 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2025-03-03 15:48:26,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:48:26,290 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:48:26,290 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:48:26,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:48:26 BoogieIcfgContainer [2025-03-03 15:48:26,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:48:26,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:48:26,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:48:26,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:48:26,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:48:16" (1/3) ... [2025-03-03 15:48:26,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac04731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:48:26, skipping insertion in model container [2025-03-03 15:48:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:18" (2/3) ... [2025-03-03 15:48:26,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac04731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:48:26, skipping insertion in model container [2025-03-03 15:48:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:48:26" (3/3) ... [2025-03-03 15:48:26,300 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.05.cil-2.c [2025-03-03 15:48:26,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:48:26,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.05.cil-2.c that has 8 procedures, 2410 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 15:48:26,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:48:26,412 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;@eb66c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:48:26,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:48:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 2410 states, 2379 states have (on average 1.844892812105927) internal successors, (4389), 2384 states have internal predecessors, (4389), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 15:48:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:26,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:26,431 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] [2025-03-03 15:48:26,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:26,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1787164735, now seen corresponding path program 1 times [2025-03-03 15:48:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261762503] [2025-03-03 15:48:26,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:26,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:26,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:26,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261762503] [2025-03-03 15:48:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261762503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:26,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:26,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627636309] [2025-03-03 15:48:26,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:26,835 INFO L87 Difference]: Start difference. First operand has 2410 states, 2379 states have (on average 1.844892812105927) internal successors, (4389), 2384 states have internal predecessors, (4389), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-03-03 15:48:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:27,339 INFO L93 Difference]: Finished difference Result 5037 states and 9207 transitions. [2025-03-03 15:48:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:48:27,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:27,359 INFO L225 Difference]: With dead ends: 5037 [2025-03-03 15:48:27,359 INFO L226 Difference]: Without dead ends: 2570 [2025-03-03 15:48:27,367 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-03-03 15:48:27,369 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4607 mSDsluCounter, 8718 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 13007 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:27,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 13007 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:48:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-03-03 15:48:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2553. [2025-03-03 15:48:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2503 states have (on average 1.8142229324810228) internal successors, (4541), 2507 states have internal predecessors, (4541), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:48:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4610 transitions. [2025-03-03 15:48:27,540 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4610 transitions. Word has length 102 [2025-03-03 15:48:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:27,541 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4610 transitions. [2025-03-03 15:48:27,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-03-03 15:48:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4610 transitions. [2025-03-03 15:48:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:27,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:27,544 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] [2025-03-03 15:48:27,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:48:27,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:27,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1665894975, now seen corresponding path program 1 times [2025-03-03 15:48:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:27,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202230830] [2025-03-03 15:48:27,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:27,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:27,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:27,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:27,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:27,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202230830] [2025-03-03 15:48:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202230830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915626041] [2025-03-03 15:48:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:27,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:27,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:27,741 INFO L87 Difference]: Start difference. First operand 2553 states and 4610 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:27,993 INFO L93 Difference]: Finished difference Result 3008 states and 5311 transitions. [2025-03-03 15:48:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:28,004 INFO L225 Difference]: With dead ends: 3008 [2025-03-03 15:48:28,004 INFO L226 Difference]: Without dead ends: 2589 [2025-03-03 15:48:28,007 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-03-03 15:48:28,007 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 4383 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4396 SdHoareTripleChecker+Valid, 12535 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:28,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4396 Valid, 12535 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-03-03 15:48:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2553. [2025-03-03 15:48:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2503 states have (on average 1.8134238913304035) internal successors, (4539), 2507 states have internal predecessors, (4539), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:48:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4608 transitions. [2025-03-03 15:48:28,064 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4608 transitions. Word has length 102 [2025-03-03 15:48:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:28,064 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4608 transitions. [2025-03-03 15:48:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4608 transitions. [2025-03-03 15:48:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:28,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:28,067 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] [2025-03-03 15:48:28,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:48:28,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 456652736, now seen corresponding path program 1 times [2025-03-03 15:48:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800516544] [2025-03-03 15:48:28,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:28,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:28,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800516544] [2025-03-03 15:48:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800516544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956398838] [2025-03-03 15:48:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:28,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:28,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:28,227 INFO L87 Difference]: Start difference. First operand 2553 states and 4608 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:28,692 INFO L93 Difference]: Finished difference Result 3230 states and 5639 transitions. [2025-03-03 15:48:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:28,703 INFO L225 Difference]: With dead ends: 3230 [2025-03-03 15:48:28,703 INFO L226 Difference]: Without dead ends: 2811 [2025-03-03 15:48:28,706 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-03-03 15:48:28,708 INFO L435 NwaCegarLoop]: 4393 mSDtfsCounter, 4527 mSDsluCounter, 13184 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4540 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:28,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4540 Valid, 17577 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2025-03-03 15:48:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2750. [2025-03-03 15:48:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2679 states have (on average 1.7920865994774169) internal successors, (4801), 2684 states have internal predecessors, (4801), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-03 15:48:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 4901 transitions. [2025-03-03 15:48:28,770 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 4901 transitions. Word has length 102 [2025-03-03 15:48:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:28,771 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 4901 transitions. [2025-03-03 15:48:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 4901 transitions. [2025-03-03 15:48:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:28,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:28,773 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] [2025-03-03 15:48:28,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:48:28,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1664570911, now seen corresponding path program 1 times [2025-03-03 15:48:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367347167] [2025-03-03 15:48:28,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:28,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:28,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:28,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367347167] [2025-03-03 15:48:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367347167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118299743] [2025-03-03 15:48:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:29,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:29,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:29,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:29,034 INFO L87 Difference]: Start difference. First operand 2750 states and 4901 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:29,598 INFO L93 Difference]: Finished difference Result 3846 states and 6567 transitions. [2025-03-03 15:48:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:29,613 INFO L225 Difference]: With dead ends: 3846 [2025-03-03 15:48:29,613 INFO L226 Difference]: Without dead ends: 3230 [2025-03-03 15:48:29,616 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-03-03 15:48:29,617 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4522 mSDsluCounter, 13172 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4535 SdHoareTripleChecker+Valid, 17561 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:29,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4535 Valid, 17561 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2025-03-03 15:48:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3163. [2025-03-03 15:48:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 3048 states have (on average 1.7572178477690288) internal successors, (5356), 3057 states have internal predecessors, (5356), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-03 15:48:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 5524 transitions. [2025-03-03 15:48:29,726 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 5524 transitions. Word has length 102 [2025-03-03 15:48:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 5524 transitions. [2025-03-03 15:48:29,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 5524 transitions. [2025-03-03 15:48:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:29,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:29,730 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] [2025-03-03 15:48:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:48:29,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:29,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 179515360, now seen corresponding path program 1 times [2025-03-03 15:48:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701102090] [2025-03-03 15:48:29,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701102090] [2025-03-03 15:48:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701102090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684932954] [2025-03-03 15:48:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:29,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:29,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:29,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:29,845 INFO L87 Difference]: Start difference. First operand 3163 states and 5524 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:30,291 INFO L93 Difference]: Finished difference Result 5149 states and 8568 transitions. [2025-03-03 15:48:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:30,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:30,306 INFO L225 Difference]: With dead ends: 5149 [2025-03-03 15:48:30,307 INFO L226 Difference]: Without dead ends: 4120 [2025-03-03 15:48:30,311 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-03-03 15:48:30,311 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4517 mSDsluCounter, 13163 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4530 SdHoareTripleChecker+Valid, 17549 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:30,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4530 Valid, 17549 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:48:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2025-03-03 15:48:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4040. [2025-03-03 15:48:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4040 states, 3831 states have (on average 1.7092143043591752) internal successors, (6548), 3854 states have internal predecessors, (6548), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-03 15:48:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 6876 transitions. [2025-03-03 15:48:30,467 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 6876 transitions. Word has length 102 [2025-03-03 15:48:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:30,467 INFO L471 AbstractCegarLoop]: Abstraction has 4040 states and 6876 transitions. [2025-03-03 15:48:30,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 6876 transitions. [2025-03-03 15:48:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:30,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:30,470 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] [2025-03-03 15:48:30,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:48:30,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash 962894335, now seen corresponding path program 1 times [2025-03-03 15:48:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427397831] [2025-03-03 15:48:30,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:30,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:30,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:30,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:30,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427397831] [2025-03-03 15:48:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427397831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:30,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:30,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269956550] [2025-03-03 15:48:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:30,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:30,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:30,556 INFO L87 Difference]: Start difference. First operand 4040 states and 6876 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:31,056 INFO L93 Difference]: Finished difference Result 8222 states and 13387 transitions. [2025-03-03 15:48:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:31,080 INFO L225 Difference]: With dead ends: 8222 [2025-03-03 15:48:31,080 INFO L226 Difference]: Without dead ends: 6316 [2025-03-03 15:48:31,087 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-03-03 15:48:31,088 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4673 mSDsluCounter, 13133 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 17510 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:31,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 17510 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2025-03-03 15:48:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 5878. [2025-03-03 15:48:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 5471 states have (on average 1.6585633339426065) internal successors, (9074), 5540 states have internal predecessors, (9074), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:48:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 9802 transitions. [2025-03-03 15:48:31,305 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 9802 transitions. Word has length 102 [2025-03-03 15:48:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:31,305 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 9802 transitions. [2025-03-03 15:48:31,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 9802 transitions. [2025-03-03 15:48:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:31,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:31,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] [2025-03-03 15:48:31,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:48:31,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:31,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 391643102, now seen corresponding path program 1 times [2025-03-03 15:48:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:31,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659675210] [2025-03-03 15:48:31,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:31,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:31,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:31,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:31,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659675210] [2025-03-03 15:48:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659675210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426410347] [2025-03-03 15:48:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:31,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:31,381 INFO L87 Difference]: Start difference. First operand 5878 states and 9802 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:31,658 INFO L93 Difference]: Finished difference Result 10120 states and 16664 transitions. [2025-03-03 15:48:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:31,690 INFO L225 Difference]: With dead ends: 10120 [2025-03-03 15:48:31,691 INFO L226 Difference]: Without dead ends: 6376 [2025-03-03 15:48:31,702 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-03-03 15:48:31,703 INFO L435 NwaCegarLoop]: 4195 mSDtfsCounter, 4373 mSDsluCounter, 8300 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4386 SdHoareTripleChecker+Valid, 12495 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:31,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4386 Valid, 12495 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2025-03-03 15:48:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 5878. [2025-03-03 15:48:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 5471 states have (on average 1.655456040943155) internal successors, (9057), 5540 states have internal predecessors, (9057), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:48:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 9785 transitions. [2025-03-03 15:48:31,963 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 9785 transitions. Word has length 102 [2025-03-03 15:48:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:31,964 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 9785 transitions. [2025-03-03 15:48:31,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 9785 transitions. [2025-03-03 15:48:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:31,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:31,969 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] [2025-03-03 15:48:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:48:31,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 511762975, now seen corresponding path program 1 times [2025-03-03 15:48:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377413084] [2025-03-03 15:48:31,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:31,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:31,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377413084] [2025-03-03 15:48:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377413084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374824559] [2025-03-03 15:48:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:32,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:32,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:32,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:32,131 INFO L87 Difference]: Start difference. First operand 5878 states and 9785 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:32,836 INFO L93 Difference]: Finished difference Result 14066 states and 22948 transitions. [2025-03-03 15:48:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:32,868 INFO L225 Difference]: With dead ends: 14066 [2025-03-03 15:48:32,869 INFO L226 Difference]: Without dead ends: 10322 [2025-03-03 15:48:32,878 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-03-03 15:48:32,879 INFO L435 NwaCegarLoop]: 4369 mSDtfsCounter, 4600 mSDsluCounter, 13110 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 17479 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:32,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 17479 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10322 states. [2025-03-03 15:48:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10322 to 9746. [2025-03-03 15:48:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6116668539957288) internal successors, (14339), 9112 states have internal predecessors, (14339), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16235 transitions. [2025-03-03 15:48:33,238 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16235 transitions. Word has length 102 [2025-03-03 15:48:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16235 transitions. [2025-03-03 15:48:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16235 transitions. [2025-03-03 15:48:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:33,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:33,246 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] [2025-03-03 15:48:33,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:48:33,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 931279806, now seen corresponding path program 1 times [2025-03-03 15:48:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895984530] [2025-03-03 15:48:33,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:33,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:33,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:33,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895984530] [2025-03-03 15:48:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895984530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655942737] [2025-03-03 15:48:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:33,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:33,318 INFO L87 Difference]: Start difference. First operand 9746 states and 16235 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:33,844 INFO L93 Difference]: Finished difference Result 18338 states and 30808 transitions. [2025-03-03 15:48:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:33,931 INFO L225 Difference]: With dead ends: 18338 [2025-03-03 15:48:33,931 INFO L226 Difference]: Without dead ends: 10726 [2025-03-03 15:48:33,981 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-03-03 15:48:33,985 INFO L435 NwaCegarLoop]: 4190 mSDtfsCounter, 4369 mSDsluCounter, 8291 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 12481 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:33,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4382 Valid, 12481 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2025-03-03 15:48:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 9746. [2025-03-03 15:48:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6079577385635608) internal successors, (14306), 9112 states have internal predecessors, (14306), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16202 transitions. [2025-03-03 15:48:34,422 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16202 transitions. Word has length 102 [2025-03-03 15:48:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16202 transitions. [2025-03-03 15:48:34,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16202 transitions. [2025-03-03 15:48:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:34,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:34,429 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] [2025-03-03 15:48:34,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:48:34,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:34,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 944812607, now seen corresponding path program 1 times [2025-03-03 15:48:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752221044] [2025-03-03 15:48:34,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:34,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:34,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:34,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:34,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752221044] [2025-03-03 15:48:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752221044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:34,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:34,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876348910] [2025-03-03 15:48:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:34,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:34,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:34,510 INFO L87 Difference]: Start difference. First operand 9746 states and 16202 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:34,949 INFO L93 Difference]: Finished difference Result 18093 states and 30252 transitions. [2025-03-03 15:48:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:34,980 INFO L225 Difference]: With dead ends: 18093 [2025-03-03 15:48:34,980 INFO L226 Difference]: Without dead ends: 10481 [2025-03-03 15:48:34,994 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-03-03 15:48:34,995 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 4366 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 12473 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:34,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4379 Valid, 12473 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10481 states. [2025-03-03 15:48:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10481 to 9746. [2025-03-03 15:48:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9746 states, 8897 states have (on average 1.6042486231313926) internal successors, (14273), 9112 states have internal predecessors, (14273), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 16169 transitions. [2025-03-03 15:48:35,393 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 16169 transitions. Word has length 102 [2025-03-03 15:48:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:35,393 INFO L471 AbstractCegarLoop]: Abstraction has 9746 states and 16169 transitions. [2025-03-03 15:48:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 16169 transitions. [2025-03-03 15:48:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:35,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:35,399 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] [2025-03-03 15:48:35,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:48:35,399 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:35,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2053627806, now seen corresponding path program 1 times [2025-03-03 15:48:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760994187] [2025-03-03 15:48:35,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:35,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:35,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:35,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:35,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760994187] [2025-03-03 15:48:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760994187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:35,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:35,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664511880] [2025-03-03 15:48:35,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:35,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:35,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:35,560 INFO L87 Difference]: Start difference. First operand 9746 states and 16169 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:36,556 INFO L93 Difference]: Finished difference Result 25470 states and 42902 transitions. [2025-03-03 15:48:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2025-03-03 15:48:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:36,625 INFO L225 Difference]: With dead ends: 25470 [2025-03-03 15:48:36,626 INFO L226 Difference]: Without dead ends: 17858 [2025-03-03 15:48:36,649 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-03-03 15:48:36,651 INFO L435 NwaCegarLoop]: 4356 mSDtfsCounter, 4489 mSDsluCounter, 13073 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 17429 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:36,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 17429 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:48:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17858 states. [2025-03-03 15:48:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17858 to 17515. [2025-03-03 15:48:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17515 states, 15636 states have (on average 1.5605653619851625) internal successors, (24401), 16305 states have internal predecessors, (24401), 821 states have call successors, (821), 391 states have call predecessors, (821), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-03 15:48:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17515 states to 17515 states and 30137 transitions. [2025-03-03 15:48:37,756 INFO L78 Accepts]: Start accepts. Automaton has 17515 states and 30137 transitions. Word has length 102 [2025-03-03 15:48:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:37,756 INFO L471 AbstractCegarLoop]: Abstraction has 17515 states and 30137 transitions. [2025-03-03 15:48:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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-03-03 15:48:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17515 states and 30137 transitions. [2025-03-03 15:48:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:48:37,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:37,765 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] [2025-03-03 15:48:37,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:48:37,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:37,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1374287265, now seen corresponding path program 1 times [2025-03-03 15:48:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:37,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223654421] [2025-03-03 15:48:37,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:37,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:48:37,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:48:37,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:37,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223654421] [2025-03-03 15:48:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223654421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:48:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106262301] [2025-03-03 15:48:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:48:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:37,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:48:37,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:48:37,815 INFO L87 Difference]: Start difference. First operand 17515 states and 30137 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:48:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:39,252 INFO L93 Difference]: Finished difference Result 47620 states and 82062 transitions. [2025-03-03 15:48:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:39,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 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 102 [2025-03-03 15:48:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:39,359 INFO L225 Difference]: With dead ends: 47620 [2025-03-03 15:48:39,360 INFO L226 Difference]: Without dead ends: 32240 [2025-03-03 15:48:39,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:48:39,395 INFO L435 NwaCegarLoop]: 4558 mSDtfsCounter, 4511 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 9043 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:39,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 9043 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:48:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32240 states. [2025-03-03 15:48:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32240 to 32175. [2025-03-03 15:48:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32175 states, 28425 states have (on average 1.5221108179419525) internal successors, (43266), 29825 states have internal predecessors, (43266), 1636 states have call successors, (1636), 781 states have call predecessors, (1636), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-03 15:48:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32175 states to 32175 states and 54665 transitions. [2025-03-03 15:48:41,077 INFO L78 Accepts]: Start accepts. Automaton has 32175 states and 54665 transitions. Word has length 102 [2025-03-03 15:48:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 32175 states and 54665 transitions. [2025-03-03 15:48:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:48:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32175 states and 54665 transitions. [2025-03-03 15:48:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:48:41,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:41,125 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:48:41,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:48:41,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:41,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash -792772746, now seen corresponding path program 1 times [2025-03-03 15:48:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:41,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712265192] [2025-03-03 15:48:41,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:41,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712265192] [2025-03-03 15:48:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712265192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876853146] [2025-03-03 15:48:41,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:41,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:48:41,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:48:41,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:41,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:41,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:41,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:41,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:48:41,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876853146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277217700] [2025-03-03 15:48:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:41,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:41,391 INFO L87 Difference]: Start difference. First operand 32175 states and 54665 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:48:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:43,618 INFO L93 Difference]: Finished difference Result 91604 states and 155779 transitions. [2025-03-03 15:48:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:48:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 167 [2025-03-03 15:48:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:43,861 INFO L225 Difference]: With dead ends: 91604 [2025-03-03 15:48:43,861 INFO L226 Difference]: Without dead ends: 61564 [2025-03-03 15:48:43,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:43,940 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4231 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:43,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 4576 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:48:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61564 states. [2025-03-03 15:48:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61564 to 61170. [2025-03-03 15:48:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61170 states, 53808 states have (on average 1.5101100208147487) internal successors, (81256), 56605 states have internal predecessors, (81256), 3136 states have call successors, (3136), 1561 states have call predecessors, (3136), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-03 15:48:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61170 states to 61170 states and 103721 transitions. [2025-03-03 15:48:47,247 INFO L78 Accepts]: Start accepts. Automaton has 61170 states and 103721 transitions. Word has length 167 [2025-03-03 15:48:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:47,247 INFO L471 AbstractCegarLoop]: Abstraction has 61170 states and 103721 transitions. [2025-03-03 15:48:47,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:48:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 61170 states and 103721 transitions. [2025-03-03 15:48:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:48:47,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:47,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:48:47,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:48:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:48:47,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -992143492, now seen corresponding path program 1 times [2025-03-03 15:48:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475657363] [2025-03-03 15:48:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:47,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:47,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:47,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475657363] [2025-03-03 15:48:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475657363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693715432] [2025-03-03 15:48:47,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:47,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:47,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:48:47,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:48:47,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:47,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:47,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:47,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:47,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:47,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:48:47,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693715432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919308390] [2025-03-03 15:48:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:47,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:47,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:47,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:47,774 INFO L87 Difference]: Start difference. First operand 61170 states and 103721 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:48:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:52,639 INFO L93 Difference]: Finished difference Result 177939 states and 302627 transitions. [2025-03-03 15:48:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:48:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 167 [2025-03-03 15:48:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:53,068 INFO L225 Difference]: With dead ends: 177939 [2025-03-03 15:48:53,068 INFO L226 Difference]: Without dead ends: 118904 [2025-03-03 15:48:53,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:53,212 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4225 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 4576 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:48:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118904 states. [2025-03-03 15:48:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118904 to 118120. [2025-03-03 15:48:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118120 states, 103664 states have (on average 1.5042444821731749) internal successors, (155936), 109255 states have internal predecessors, (155936), 6006 states have call successors, (6006), 3121 states have call predecessors, (6006), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-03 15:48:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118120 states to 118120 states and 200273 transitions. [2025-03-03 15:48:59,024 INFO L78 Accepts]: Start accepts. Automaton has 118120 states and 200273 transitions. Word has length 167 [2025-03-03 15:48:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:59,025 INFO L471 AbstractCegarLoop]: Abstraction has 118120 states and 200273 transitions. [2025-03-03 15:48:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:48:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 118120 states and 200273 transitions. [2025-03-03 15:48:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:48:59,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:59,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:48:59,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:48:59,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:48:59,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 975629314, now seen corresponding path program 1 times [2025-03-03 15:48:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29544786] [2025-03-03 15:48:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:59,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:59,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:59,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:59,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29544786] [2025-03-03 15:48:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29544786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606068864] [2025-03-03 15:48:59,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:59,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:59,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:48:59,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:48:59,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:48:59,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:48:59,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:59,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:59,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:48:59,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:59,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606068864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:59,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171836154] [2025-03-03 15:48:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:59,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:59,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:59,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:59,626 INFO L87 Difference]: Start difference. First operand 118120 states and 200273 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)