./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-1.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_label43+token_ring.04.cil-1.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 e00c3fe8d0c18f678a1828bfe849f51bd28f58902f8fb74e3907dba377893684 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:39:42,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:39:43,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:39:43,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:39:43,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:39:43,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:39:43,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:39:43,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:39:43,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:39:43,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:39:43,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:39:43,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:39:43,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:39:43,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:39:43,082 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:39:43,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:39:43,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:39:43,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:39:43,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:39:43,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:39:43,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:39:43,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:39:43,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:39:43,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:39:43,085 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 -> e00c3fe8d0c18f678a1828bfe849f51bd28f58902f8fb74e3907dba377893684 [2025-03-03 15:39:43,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:39:43,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:39:43,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:39:43,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:39:43,299 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:39:43,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-1.c [2025-03-03 15:39:44,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6968e909/b9723079f28b403f8a50052e092ff997/FLAGa1365ccb5 [2025-03-03 15:39:45,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:39:45,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-1.c [2025-03-03 15:39:45,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6968e909/b9723079f28b403f8a50052e092ff997/FLAGa1365ccb5 [2025-03-03 15:39:45,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6968e909/b9723079f28b403f8a50052e092ff997 [2025-03-03 15:39:45,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:39:45,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:39:45,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:45,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:39:45,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:39:45,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:45" (1/1) ... [2025-03-03 15:39:45,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4370edd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:45, skipping insertion in model container [2025-03-03 15:39:45,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:45" (1/1) ... [2025-03-03 15:39:45,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:39:46,674 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_label43+token_ring.04.cil-1.c[381679,381692] [2025-03-03 15:39:46,702 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_label43+token_ring.04.cil-1.c[383339,383352] [2025-03-03 15:39:46,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:46,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:39:47,362 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_label43+token_ring.04.cil-1.c[381679,381692] [2025-03-03 15:39:47,366 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_label43+token_ring.04.cil-1.c[383339,383352] [2025-03-03 15:39:47,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:47,422 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:39:47,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47 WrapperNode [2025-03-03 15:39:47,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:47,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:47,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:39:47,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:39:47,428 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:39:47" (1/1) ... [2025-03-03 15:39:47,487 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:39:47" (1/1) ... [2025-03-03 15:39:47,873 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-03-03 15:39:47,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:47,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:39:47,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:39:47,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:39:47,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:47,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:47,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:47,984 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:39:47,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:47,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:39:48,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:39:48,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:39:48,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:39:48,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (1/1) ... [2025-03-03 15:39:48,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:39:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:48,271 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:39:48,276 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:39:48,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:39:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:39:48,292 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:39:48,292 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:39:48,292 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:39:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:39:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:39:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:39:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:39:48,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:39:48,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:39:48,426 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:39:48,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:39:54,251 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:39:54,252 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:39:54,252 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:39:54,252 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:39:54,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:39:54,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:39:54,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:39:54,542 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2025-03-03 15:39:54,543 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:39:54,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:39:54,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:39:54,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:54 BoogieIcfgContainer [2025-03-03 15:39:54,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:39:54,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:39:54,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:39:54,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:39:54,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:39:45" (1/3) ... [2025-03-03 15:39:54,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d008d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:54, skipping insertion in model container [2025-03-03 15:39:54,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:47" (2/3) ... [2025-03-03 15:39:54,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d008d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:54, skipping insertion in model container [2025-03-03 15:39:54,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:54" (3/3) ... [2025-03-03 15:39:54,603 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-1.c [2025-03-03 15:39:54,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:39:54,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.04.cil-1.c that has 7 procedures, 2375 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-03 15:39:54,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:39:54,718 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;@2eed2476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:39:54,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:39:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 15:39:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:54,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:54,740 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] [2025-03-03 15:39:54,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:54,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2045429622, now seen corresponding path program 1 times [2025-03-03 15:39:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145556856] [2025-03-03 15:39:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:54,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:54,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:54,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:54,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:55,115 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:39:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145556856] [2025-03-03 15:39:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145556856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781591496] [2025-03-03 15:39:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:55,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:55,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:55,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:55,144 INFO L87 Difference]: Start difference. First operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:55,627 INFO L93 Difference]: Finished difference Result 4932 states and 9029 transitions. [2025-03-03 15:39:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:39:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:55,645 INFO L225 Difference]: With dead ends: 4932 [2025-03-03 15:39:55,646 INFO L226 Difference]: Without dead ends: 2499 [2025-03-03 15:39:55,653 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:39:55,655 INFO L435 NwaCegarLoop]: 4244 mSDtfsCounter, 4506 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 12843 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:55,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 12843 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-03 15:39:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2486. [2025-03-03 15:39:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8184426229508197) internal successors, (4437), 2443 states have internal predecessors, (4437), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 15:39:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4500 transitions. [2025-03-03 15:39:55,792 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4500 transitions. Word has length 90 [2025-03-03 15:39:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4500 transitions. [2025-03-03 15:39:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4500 transitions. [2025-03-03 15:39:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:55,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:55,798 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] [2025-03-03 15:39:55,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:39:55,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -689383752, now seen corresponding path program 1 times [2025-03-03 15:39:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524233628] [2025-03-03 15:39:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:55,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:55,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:55,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:55,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:55,964 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:39:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:55,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524233628] [2025-03-03 15:39:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524233628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243629273] [2025-03-03 15:39:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:55,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:55,967 INFO L87 Difference]: Start difference. First operand 2486 states and 4500 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:56,208 INFO L93 Difference]: Finished difference Result 2869 states and 5081 transitions. [2025-03-03 15:39:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:56,222 INFO L225 Difference]: With dead ends: 2869 [2025-03-03 15:39:56,222 INFO L226 Difference]: Without dead ends: 2516 [2025-03-03 15:39:56,225 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:39:56,225 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4309 mSDsluCounter, 8251 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12414 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:56,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12414 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-03-03 15:39:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2486. [2025-03-03 15:39:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8176229508196722) internal successors, (4435), 2443 states have internal predecessors, (4435), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 15:39:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4498 transitions. [2025-03-03 15:39:56,292 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4498 transitions. Word has length 90 [2025-03-03 15:39:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4498 transitions. [2025-03-03 15:39:56,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4498 transitions. [2025-03-03 15:39:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:56,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:56,296 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] [2025-03-03 15:39:56,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:39:56,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -245772329, now seen corresponding path program 1 times [2025-03-03 15:39:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:56,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549190221] [2025-03-03 15:39:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:56,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:56,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:56,436 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:39:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:56,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549190221] [2025-03-03 15:39:56,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549190221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121040204] [2025-03-03 15:39:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:56,439 INFO L87 Difference]: Start difference. First operand 2486 states and 4498 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:56,849 INFO L93 Difference]: Finished difference Result 3054 states and 5348 transitions. [2025-03-03 15:39:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:56,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:56,861 INFO L225 Difference]: With dead ends: 3054 [2025-03-03 15:39:56,861 INFO L226 Difference]: Without dead ends: 2701 [2025-03-03 15:39:56,863 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:39:56,865 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4425 mSDsluCounter, 12931 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 17243 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:56,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 17243 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-03 15:39:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2652. [2025-03-03 15:39:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2586 states have (on average 1.797370456303171) internal successors, (4648), 2590 states have internal predecessors, (4648), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-03 15:39:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4740 transitions. [2025-03-03 15:39:56,942 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4740 transitions. Word has length 90 [2025-03-03 15:39:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4740 transitions. [2025-03-03 15:39:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4740 transitions. [2025-03-03 15:39:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:56,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:56,944 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] [2025-03-03 15:39:56,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:39:56,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:56,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1201293608, now seen corresponding path program 1 times [2025-03-03 15:39:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131240268] [2025-03-03 15:39:56,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:56,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:57,130 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:39:57,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:57,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131240268] [2025-03-03 15:39:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131240268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:57,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845032285] [2025-03-03 15:39:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:57,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:57,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:57,133 INFO L87 Difference]: Start difference. First operand 2652 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:57,586 INFO L93 Difference]: Finished difference Result 3571 states and 6111 transitions. [2025-03-03 15:39:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:57,600 INFO L225 Difference]: With dead ends: 3571 [2025-03-03 15:39:57,600 INFO L226 Difference]: Without dead ends: 3052 [2025-03-03 15:39:57,604 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:39:57,604 INFO L435 NwaCegarLoop]: 4308 mSDtfsCounter, 4420 mSDsluCounter, 12919 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4432 SdHoareTripleChecker+Valid, 17227 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:57,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4432 Valid, 17227 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-03 15:39:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2999. [2025-03-03 15:39:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2891 states have (on average 1.763057765479073) internal successors, (5097), 2899 states have internal predecessors, (5097), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-03 15:39:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5253 transitions. [2025-03-03 15:39:57,699 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5253 transitions. Word has length 90 [2025-03-03 15:39:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:57,699 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5253 transitions. [2025-03-03 15:39:57,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5253 transitions. [2025-03-03 15:39:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:57,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:57,701 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] [2025-03-03 15:39:57,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:39:57,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:57,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash 984640439, now seen corresponding path program 1 times [2025-03-03 15:39:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076446644] [2025-03-03 15:39:57,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:57,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:57,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:57,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:57,831 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:39:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076446644] [2025-03-03 15:39:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076446644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:57,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:57,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327510041] [2025-03-03 15:39:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:57,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:57,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:57,835 INFO L87 Difference]: Start difference. First operand 2999 states and 5253 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:58,309 INFO L93 Difference]: Finished difference Result 4660 states and 7750 transitions. [2025-03-03 15:39:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:58,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:58,325 INFO L225 Difference]: With dead ends: 4660 [2025-03-03 15:39:58,325 INFO L226 Difference]: Without dead ends: 3794 [2025-03-03 15:39:58,329 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:39:58,329 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4415 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 17215 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:58,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 17215 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2025-03-03 15:39:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3732. [2025-03-03 15:39:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3534 states have (on average 1.712790039615167) internal successors, (6053), 3556 states have internal predecessors, (6053), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-03 15:39:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 6361 transitions. [2025-03-03 15:39:58,444 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 6361 transitions. Word has length 90 [2025-03-03 15:39:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:58,444 INFO L471 AbstractCegarLoop]: Abstraction has 3732 states and 6361 transitions. [2025-03-03 15:39:58,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 6361 transitions. [2025-03-03 15:39:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:58,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:58,446 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] [2025-03-03 15:39:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:39:58,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 500965112, now seen corresponding path program 1 times [2025-03-03 15:39:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:58,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816946225] [2025-03-03 15:39:58,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:58,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:58,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:58,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:58,542 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:39:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816946225] [2025-03-03 15:39:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816946225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859929810] [2025-03-03 15:39:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:58,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:58,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:58,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:58,544 INFO L87 Difference]: Start difference. First operand 3732 states and 6361 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:59,024 INFO L93 Difference]: Finished difference Result 7239 states and 11737 transitions. [2025-03-03 15:39:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:59,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:59,048 INFO L225 Difference]: With dead ends: 7239 [2025-03-03 15:39:59,049 INFO L226 Difference]: Without dead ends: 5640 [2025-03-03 15:39:59,055 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:39:59,057 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4544 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 17190 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:59,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 17190 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2025-03-03 15:39:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5273. [2025-03-03 15:39:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.655885363357216) internal successors, (8089), 4953 states have internal predecessors, (8089), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 15:39:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8781 transitions. [2025-03-03 15:39:59,332 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8781 transitions. Word has length 90 [2025-03-03 15:39:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:59,332 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8781 transitions. [2025-03-03 15:39:59,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8781 transitions. [2025-03-03 15:39:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:59,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:59,336 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] [2025-03-03 15:39:59,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:39:59,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1455194007, now seen corresponding path program 1 times [2025-03-03 15:39:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593717945] [2025-03-03 15:39:59,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:59,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:59,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:59,404 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:39:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593717945] [2025-03-03 15:39:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593717945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:59,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575954996] [2025-03-03 15:39:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:59,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:59,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:59,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:59,406 INFO L87 Difference]: Start difference. First operand 5273 states and 8781 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:59,660 INFO L93 Difference]: Finished difference Result 8828 states and 14458 transitions. [2025-03-03 15:39:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:39:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:59,693 INFO L225 Difference]: With dead ends: 8828 [2025-03-03 15:39:59,693 INFO L226 Difference]: Without dead ends: 5688 [2025-03-03 15:39:59,701 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:39:59,702 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4307 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 12362 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:59,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 12362 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:39:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2025-03-03 15:39:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5273. [2025-03-03 15:39:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.652405322415558) internal successors, (8072), 4953 states have internal predecessors, (8072), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 15:39:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8764 transitions. [2025-03-03 15:39:59,854 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8764 transitions. Word has length 90 [2025-03-03 15:39:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:59,856 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8764 transitions. [2025-03-03 15:39:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8764 transitions. [2025-03-03 15:39:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:39:59,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:59,859 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] [2025-03-03 15:39:59,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:39:59,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1208880920, now seen corresponding path program 1 times [2025-03-03 15:39:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883078355] [2025-03-03 15:39:59,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:59,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:39:59,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:39:59,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:59,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:59,953 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:39:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883078355] [2025-03-03 15:39:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883078355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:59,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047498267] [2025-03-03 15:39:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:59,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:59,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:59,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:59,955 INFO L87 Difference]: Start difference. First operand 5273 states and 8764 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:00,553 INFO L93 Difference]: Finished difference Result 12074 states and 19568 transitions. [2025-03-03 15:40:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:00,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:40:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:00,584 INFO L225 Difference]: With dead ends: 12074 [2025-03-03 15:40:00,585 INFO L226 Difference]: Without dead ends: 8934 [2025-03-03 15:40:00,594 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:40:00,595 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4471 mSDsluCounter, 12867 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 17159 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:00,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 17159 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:40:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2025-03-03 15:40:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 8493. [2025-03-03 15:40:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5973434040890742) internal successors, (12266), 7893 states have internal predecessors, (12266), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:40:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14094 transitions. [2025-03-03 15:40:00,886 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14094 transitions. Word has length 90 [2025-03-03 15:40:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:00,886 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14094 transitions. [2025-03-03 15:40:00,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14094 transitions. [2025-03-03 15:40:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:40:00,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:00,894 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] [2025-03-03 15:40:00,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:40:00,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:00,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash -461632649, now seen corresponding path program 1 times [2025-03-03 15:40:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965542989] [2025-03-03 15:40:00,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:00,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:40:00,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:40:00,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:00,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:00,957 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:40:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965542989] [2025-03-03 15:40:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965542989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622454745] [2025-03-03 15:40:00,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:00,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:00,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:00,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:00,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:00,959 INFO L87 Difference]: Start difference. First operand 8493 states and 14094 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:01,381 INFO L93 Difference]: Finished difference Result 15588 states and 26038 transitions. [2025-03-03 15:40:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:40:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:01,411 INFO L225 Difference]: With dead ends: 15588 [2025-03-03 15:40:01,411 INFO L226 Difference]: Without dead ends: 9228 [2025-03-03 15:40:01,424 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:40:01,425 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4296 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4308 SdHoareTripleChecker+Valid, 12366 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:01,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4308 Valid, 12366 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:40:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2025-03-03 15:40:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8493. [2025-03-03 15:40:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5930459695272823) internal successors, (12233), 7893 states have internal predecessors, (12233), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:40:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14061 transitions. [2025-03-03 15:40:01,714 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14061 transitions. Word has length 90 [2025-03-03 15:40:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:01,714 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14061 transitions. [2025-03-03 15:40:01,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14061 transitions. [2025-03-03 15:40:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:40:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:01,718 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] [2025-03-03 15:40:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:40:01,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1069709512, now seen corresponding path program 1 times [2025-03-03 15:40:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:01,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915431023] [2025-03-03 15:40:01,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:40:01,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:40:01,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:01,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:01,771 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:40:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915431023] [2025-03-03 15:40:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915431023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:01,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:01,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007179477] [2025-03-03 15:40:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:01,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:01,773 INFO L87 Difference]: Start difference. First operand 8493 states and 14061 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:02,299 INFO L93 Difference]: Finished difference Result 15343 states and 25482 transitions. [2025-03-03 15:40:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:40:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:02,335 INFO L225 Difference]: With dead ends: 15343 [2025-03-03 15:40:02,335 INFO L226 Difference]: Without dead ends: 8983 [2025-03-03 15:40:02,353 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:40:02,353 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4293 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 12358 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:02,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 12358 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:40:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2025-03-03 15:40:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8493. [2025-03-03 15:40:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5887485349654904) internal successors, (12200), 7893 states have internal predecessors, (12200), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:40:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14028 transitions. [2025-03-03 15:40:02,804 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14028 transitions. Word has length 90 [2025-03-03 15:40:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:02,804 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14028 transitions. [2025-03-03 15:40:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14028 transitions. [2025-03-03 15:40:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:40:02,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:02,809 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] [2025-03-03 15:40:02,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:40:02,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 711790423, now seen corresponding path program 1 times [2025-03-03 15:40:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321585915] [2025-03-03 15:40:02,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:02,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:40:02,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:40:02,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:02,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:02,858 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:40:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:02,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321585915] [2025-03-03 15:40:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321585915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:02,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:40:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007571527] [2025-03-03 15:40:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:02,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:40:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:40:02,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:40:02,861 INFO L87 Difference]: Start difference. First operand 8493 states and 14028 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:03,308 INFO L93 Difference]: Finished difference Result 21043 states and 34229 transitions. [2025-03-03 15:40:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-03-03 15:40:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:03,352 INFO L225 Difference]: With dead ends: 21043 [2025-03-03 15:40:03,352 INFO L226 Difference]: Without dead ends: 14684 [2025-03-03 15:40:03,370 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:40:03,371 INFO L435 NwaCegarLoop]: 4462 mSDtfsCounter, 4422 mSDsluCounter, 4395 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8857 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:03,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8857 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:40:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-03-03 15:40:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14651. [2025-03-03 15:40:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 13029 states have (on average 1.532274157648323) internal successors, (19964), 13488 states have internal predecessors, (19964), 800 states have call successors, (800), 396 states have call predecessors, (800), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-03-03 15:40:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 23581 transitions. [2025-03-03 15:40:03,936 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 23581 transitions. Word has length 90 [2025-03-03 15:40:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:03,936 INFO L471 AbstractCegarLoop]: Abstraction has 14651 states and 23581 transitions. [2025-03-03 15:40:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 23581 transitions. [2025-03-03 15:40:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:40:03,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:03,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:03,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:40:03,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:03,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1908313067, now seen corresponding path program 1 times [2025-03-03 15:40:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:03,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672371646] [2025-03-03 15:40:03,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:03,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:03,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:40:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672371646] [2025-03-03 15:40:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672371646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845498769] [2025-03-03 15:40:04,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:04,025 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:40:04,026 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:40:04,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:04,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:04,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:04,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:04,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:04,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:40:04,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845498769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:40:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994596696] [2025-03-03 15:40:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:04,208 INFO L87 Difference]: Start difference. First operand 14651 states and 23581 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:04,899 INFO L93 Difference]: Finished difference Result 39354 states and 62625 transitions. [2025-03-03 15:40:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:40:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:04,980 INFO L225 Difference]: With dead ends: 39354 [2025-03-03 15:40:04,981 INFO L226 Difference]: Without dead ends: 26837 [2025-03-03 15:40:05,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:40:05,008 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4179 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4179 SdHoareTripleChecker+Valid, 4468 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:40:05,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4179 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26837 states. [2025-03-03 15:40:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26837 to 26637. [2025-03-03 15:40:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23465 states have (on average 1.5041125079906243) internal successors, (35294), 24381 states have internal predecessors, (35294), 1530 states have call successors, (1530), 792 states have call predecessors, (1530), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-03-03 15:40:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 42357 transitions. [2025-03-03 15:40:06,395 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 42357 transitions. Word has length 148 [2025-03-03 15:40:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:06,395 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 42357 transitions. [2025-03-03 15:40:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 42357 transitions. [2025-03-03 15:40:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:40:06,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:06,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:06,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:40:06,638 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,SelfDestructingSolverStorable11 [2025-03-03 15:40:06,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:06,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -905321189, now seen corresponding path program 1 times [2025-03-03 15:40:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:06,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542016845] [2025-03-03 15:40:06,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:06,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:06,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:40:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542016845] [2025-03-03 15:40:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542016845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:06,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247409261] [2025-03-03 15:40:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:06,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:06,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:06,716 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:40:06,717 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:40:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:06,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:06,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:06,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:40:06,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247409261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:40:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936164248] [2025-03-03 15:40:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:06,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:06,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:06,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:06,889 INFO L87 Difference]: Start difference. First operand 26637 states and 42357 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:08,477 INFO L93 Difference]: Finished difference Result 74982 states and 118759 transitions. [2025-03-03 15:40:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:08,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:40:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:08,638 INFO L225 Difference]: With dead ends: 74982 [2025-03-03 15:40:08,638 INFO L226 Difference]: Without dead ends: 50479 [2025-03-03 15:40:08,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:40:08,692 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4173 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 4468 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:40:08,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50479 states. [2025-03-03 15:40:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50479 to 50081. [2025-03-03 15:40:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50081 states, 43875 states have (on average 1.488182336182336) internal successors, (65294), 45705 states have internal predecessors, (65294), 2924 states have call successors, (2924), 1584 states have call predecessors, (2924), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-03-03 15:40:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50081 states to 50081 states and 79117 transitions. [2025-03-03 15:40:10,650 INFO L78 Accepts]: Start accepts. Automaton has 50081 states and 79117 transitions. Word has length 148 [2025-03-03 15:40:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:10,650 INFO L471 AbstractCegarLoop]: Abstraction has 50081 states and 79117 transitions. [2025-03-03 15:40:10,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 50081 states and 79117 transitions. [2025-03-03 15:40:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:40:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:10,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:10,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:10,895 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,SelfDestructingSolverStorable12 [2025-03-03 15:40:10,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -584772959, now seen corresponding path program 1 times [2025-03-03 15:40:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947771588] [2025-03-03 15:40:10,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:10,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:10,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:40:10,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947771588] [2025-03-03 15:40:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947771588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674168069] [2025-03-03 15:40:10,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:10,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:10,996 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:40:11,007 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:40:11,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:11,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:11,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:11,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:11,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:40:11,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674168069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:40:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536588870] [2025-03-03 15:40:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:11,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:11,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:11,184 INFO L87 Difference]: Start difference. First operand 50081 states and 79117 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:15,077 INFO L93 Difference]: Finished difference Result 145038 states and 229225 transitions. [2025-03-03 15:40:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:15,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:40:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:15,470 INFO L225 Difference]: With dead ends: 145038 [2025-03-03 15:40:15,470 INFO L226 Difference]: Without dead ends: 97091 [2025-03-03 15:40:15,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:40:15,606 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4185 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4468 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:40:15,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97091 states. [2025-03-03 15:40:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97091 to 96297. [2025-03-03 15:40:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96297 states, 84027 states have (on average 1.4784533542789817) internal successors, (124230), 87685 states have internal predecessors, (124230), 5708 states have call successors, (5708), 3168 states have call predecessors, (5708), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-03-03 15:40:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96297 states to 96297 states and 151565 transitions. [2025-03-03 15:40:20,773 INFO L78 Accepts]: Start accepts. Automaton has 96297 states and 151565 transitions. Word has length 148 [2025-03-03 15:40:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 96297 states and 151565 transitions. [2025-03-03 15:40:20,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 96297 states and 151565 transitions. [2025-03-03 15:40:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:40:21,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:21,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:21,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:21,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 8005415, now seen corresponding path program 1 times [2025-03-03 15:40:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:21,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543238055] [2025-03-03 15:40:21,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:21,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:21,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:21,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:40:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543238055] [2025-03-03 15:40:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543238055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284647814] [2025-03-03 15:40:21,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:21,338 INFO L229 MonitoredProcess]: Starting monitored process 5 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:40:21,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:40:21,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:21,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:21,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:40:21,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:21,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284647814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:21,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:21,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:40:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979617044] [2025-03-03 15:40:21,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:21,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:21,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:21,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:21,495 INFO L87 Difference]: Start difference. First operand 96297 states and 151565 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:27,571 INFO L93 Difference]: Finished difference Result 282750 states and 446297 transitions. [2025-03-03 15:40:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:27,572 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:40:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:28,223 INFO L225 Difference]: With dead ends: 282750 [2025-03-03 15:40:28,224 INFO L226 Difference]: Without dead ends: 188587 [2025-03-03 15:40:28,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:40:28,634 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4167 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 4468 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:40:28,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188587 states. [2025-03-03 15:40:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188587 to 187001. [2025-03-03 15:40:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187001 states, 162739 states have (on average 1.4730212180239524) internal successors, (239718), 170053 states have internal predecessors, (239718), 11140 states have call successors, (11140), 6336 states have call predecessors, (11140), 13120 states have return successors, (42947), 10643 states have call predecessors, (42947), 11140 states have call successors, (42947) [2025-03-03 15:40:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187001 states to 187001 states and 293805 transitions. [2025-03-03 15:40:37,084 INFO L78 Accepts]: Start accepts. Automaton has 187001 states and 293805 transitions. Word has length 148 [2025-03-03 15:40:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:37,084 INFO L471 AbstractCegarLoop]: Abstraction has 187001 states and 293805 transitions. [2025-03-03 15:40:37,085 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:40:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 187001 states and 293805 transitions. [2025-03-03 15:40:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:40:37,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:37,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 15:40:37,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1664126675, now seen corresponding path program 1 times [2025-03-03 15:40:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320322594] [2025-03-03 15:40:37,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:37,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:37,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:40:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320322594] [2025-03-03 15:40:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320322594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926037975] [2025-03-03 15:40:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:37,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:37,451 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:40:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:40:37,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:40:37,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:37,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:37,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:37,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 15:40:37,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926037975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:37,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375387858] [2025-03-03 15:40:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:37,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:37,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:37,586 INFO L87 Difference]: Start difference. First operand 187001 states and 293805 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)