./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label46+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:03:26,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:03:26,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:03:26,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:03:26,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:03:26,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:03:26,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:03:26,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:03:26,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:03:26,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:03:26,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:03:26,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:03:26,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:03:26,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:03:26,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:03:26,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:03:26,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:03:26,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:26,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:03:26,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:03:26,892 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 -> 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 [2025-03-16 20:03:27,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:03:27,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:03:27,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:03:27,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:03:27,283 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:03:27,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2025-03-16 20:03:28,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bac53bd9/7343a9ef811242019f1076fd41a06474/FLAG738a4f70a [2025-03-16 20:03:29,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:03:29,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2025-03-16 20:03:29,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bac53bd9/7343a9ef811242019f1076fd41a06474/FLAG738a4f70a [2025-03-16 20:03:29,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bac53bd9/7343a9ef811242019f1076fd41a06474 [2025-03-16 20:03:29,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:03:29,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:03:29,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:29,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:03:29,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:03:29,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:29" (1/1) ... [2025-03-16 20:03:29,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a613e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:29, skipping insertion in model container [2025-03-16 20:03:29,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:03:29" (1/1) ... [2025-03-16 20:03:29,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:03:30,813 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_label46+token_ring.03.cil-2.c[382357,382370] [2025-03-16 20:03:30,841 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_label46+token_ring.03.cil-2.c[383339,383352] [2025-03-16 20:03:31,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:31,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:03:31,550 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_label46+token_ring.03.cil-2.c[382357,382370] [2025-03-16 20:03:31,553 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_label46+token_ring.03.cil-2.c[383339,383352] [2025-03-16 20:03:31,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:03:31,615 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:03:31,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31 WrapperNode [2025-03-16 20:03:31,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:03:31,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:31,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:03:31,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:03:31,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:31,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:31,959 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-16 20:03:31,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:03:31,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:03:31,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:03:31,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:03:31,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:31,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,090 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-16 20:03:32,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:03:32,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:03:32,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:03:32,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:03:32,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (1/1) ... [2025-03-16 20:03:32,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:03:32,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:32,450 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-16 20:03:32,452 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-16 20:03:32,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:03:32,473 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:03:32,473 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:03:32,473 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:03:32,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:03:32,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:03:32,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:03:32,565 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:03:38,346 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:03:38,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:03:38,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:03:38,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:03:38,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:03:38,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:03:38,348 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:03:38,502 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2025-03-16 20:03:38,502 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:03:38,546 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:03:38,546 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:03:38,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:03:38 BoogieIcfgContainer [2025-03-16 20:03:38,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:03:38,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:03:38,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:03:38,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:03:38,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:03:29" (1/3) ... [2025-03-16 20:03:38,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6283ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:03:38, skipping insertion in model container [2025-03-16 20:03:38,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:03:31" (2/3) ... [2025-03-16 20:03:38,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6283ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:03:38, skipping insertion in model container [2025-03-16 20:03:38,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:03:38" (3/3) ... [2025-03-16 20:03:38,553 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-2.c [2025-03-16 20:03:38,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:03:38,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.03.cil-2.c that has 7 procedures, 2268 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-16 20:03:38,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:03:38,665 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;@7b032f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:03:38,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:03:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 2268 states, 2243 states have (on average 1.8791796700847079) internal successors, (4215), 2245 states have internal predecessors, (4215), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-16 20:03:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:38,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:38,682 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] [2025-03-16 20:03:38,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -441018170, now seen corresponding path program 1 times [2025-03-16 20:03:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605136168] [2025-03-16 20:03:38,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:38,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:38,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:38,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:38,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:39,037 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-16 20:03:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605136168] [2025-03-16 20:03:39,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605136168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:39,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:39,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847089362] [2025-03-16 20:03:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:39,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:39,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:39,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:39,068 INFO L87 Difference]: Start difference. First operand has 2268 states, 2243 states have (on average 1.8791796700847079) internal successors, (4215), 2245 states have internal predecessors, (4215), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:39,453 INFO L93 Difference]: Finished difference Result 4676 states and 8720 transitions. [2025-03-16 20:03:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:03:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:39,473 INFO L225 Difference]: With dead ends: 4676 [2025-03-16 20:03:39,473 INFO L226 Difference]: Without dead ends: 2409 [2025-03-16 20:03:39,481 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-16 20:03:39,483 INFO L435 NwaCegarLoop]: 4133 mSDtfsCounter, 4335 mSDsluCounter, 8342 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4346 SdHoareTripleChecker+Valid, 12475 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:39,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4346 Valid, 12475 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-03-16 20:03:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2398. [2025-03-16 20:03:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2354 states have (on average 1.8351741716227699) internal successors, (4320), 2357 states have internal predecessors, (4320), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:03:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4379 transitions. [2025-03-16 20:03:39,613 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4379 transitions. Word has length 71 [2025-03-16 20:03:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:39,614 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4379 transitions. [2025-03-16 20:03:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4379 transitions. [2025-03-16 20:03:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:39,617 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] [2025-03-16 20:03:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:03:39,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:39,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2057089672, now seen corresponding path program 1 times [2025-03-16 20:03:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048825447] [2025-03-16 20:03:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:39,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:39,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:39,812 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-16 20:03:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048825447] [2025-03-16 20:03:39,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048825447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:39,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:39,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891789042] [2025-03-16 20:03:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:39,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:39,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:39,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:39,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:39,814 INFO L87 Difference]: Start difference. First operand 2398 states and 4379 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:40,049 INFO L93 Difference]: Finished difference Result 2690 states and 4831 transitions. [2025-03-16 20:03:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:40,060 INFO L225 Difference]: With dead ends: 2690 [2025-03-16 20:03:40,061 INFO L226 Difference]: Without dead ends: 2422 [2025-03-16 20:03:40,063 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-16 20:03:40,063 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4228 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4239 SdHoareTripleChecker+Valid, 12280 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:40,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4239 Valid, 12280 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-03-16 20:03:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2398. [2025-03-16 20:03:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2354 states have (on average 1.8343245539507222) internal successors, (4318), 2357 states have internal predecessors, (4318), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:03:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4377 transitions. [2025-03-16 20:03:40,123 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4377 transitions. Word has length 71 [2025-03-16 20:03:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:40,123 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4377 transitions. [2025-03-16 20:03:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4377 transitions. [2025-03-16 20:03:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:40,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:40,126 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] [2025-03-16 20:03:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:03:40,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash 126470567, now seen corresponding path program 1 times [2025-03-16 20:03:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100372138] [2025-03-16 20:03:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:40,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:40,281 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-16 20:03:40,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100372138] [2025-03-16 20:03:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100372138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705877051] [2025-03-16 20:03:40,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:40,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:40,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:40,285 INFO L87 Difference]: Start difference. First operand 2398 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:40,745 INFO L93 Difference]: Finished difference Result 2830 states and 5034 transitions. [2025-03-16 20:03:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:40,757 INFO L225 Difference]: With dead ends: 2830 [2025-03-16 20:03:40,757 INFO L226 Difference]: Without dead ends: 2562 [2025-03-16 20:03:40,760 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-16 20:03:40,762 INFO L435 NwaCegarLoop]: 4228 mSDtfsCounter, 4313 mSDsluCounter, 12656 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4324 SdHoareTripleChecker+Valid, 16884 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:40,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4324 Valid, 16884 Invalid, 495 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-16 20:03:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2523. [2025-03-16 20:03:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2460 states have (on average 1.8199186991869918) internal successors, (4477), 2464 states have internal predecessors, (4477), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-16 20:03:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4563 transitions. [2025-03-16 20:03:40,832 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 4563 transitions. Word has length 71 [2025-03-16 20:03:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:40,832 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 4563 transitions. [2025-03-16 20:03:40,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4563 transitions. [2025-03-16 20:03:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:40,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:40,834 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] [2025-03-16 20:03:40,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:03:40,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:40,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash 756929192, now seen corresponding path program 1 times [2025-03-16 20:03:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756127184] [2025-03-16 20:03:40,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:40,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:40,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:40,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:40,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:40,977 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-16 20:03:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756127184] [2025-03-16 20:03:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756127184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:40,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:40,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308356158] [2025-03-16 20:03:40,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:40,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:40,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:40,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:40,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:40,981 INFO L87 Difference]: Start difference. First operand 2523 states and 4563 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:41,337 INFO L93 Difference]: Finished difference Result 3218 states and 5617 transitions. [2025-03-16 20:03:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:41,348 INFO L225 Difference]: With dead ends: 3218 [2025-03-16 20:03:41,348 INFO L226 Difference]: Without dead ends: 2825 [2025-03-16 20:03:41,350 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-16 20:03:41,350 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 4308 mSDsluCounter, 12644 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 16868 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:41,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 16868 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2025-03-16 20:03:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2784. [2025-03-16 20:03:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2681 states have (on average 1.794106676613204) internal successors, (4810), 2689 states have internal predecessors, (4810), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-03-16 20:03:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4956 transitions. [2025-03-16 20:03:41,433 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4956 transitions. Word has length 71 [2025-03-16 20:03:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:41,433 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4956 transitions. [2025-03-16 20:03:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4956 transitions. [2025-03-16 20:03:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:41,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:41,434 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] [2025-03-16 20:03:41,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:03:41,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:41,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash 777266567, now seen corresponding path program 1 times [2025-03-16 20:03:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676520899] [2025-03-16 20:03:41,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:41,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:41,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:41,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:41,530 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-16 20:03:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676520899] [2025-03-16 20:03:41,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676520899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:41,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:41,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:41,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390046640] [2025-03-16 20:03:41,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:41,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:41,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:41,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:41,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:41,532 INFO L87 Difference]: Start difference. First operand 2784 states and 4956 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:41,922 INFO L93 Difference]: Finished difference Result 4121 states and 7001 transitions. [2025-03-16 20:03:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:03:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:41,936 INFO L225 Difference]: With dead ends: 4121 [2025-03-16 20:03:41,936 INFO L226 Difference]: Without dead ends: 3467 [2025-03-16 20:03:41,940 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-16 20:03:41,941 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4395 mSDsluCounter, 12624 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 16843 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:41,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 16843 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:03:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2025-03-16 20:03:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3321. [2025-03-16 20:03:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7544642857142858) internal successors, (5502), 3158 states have internal predecessors, (5502), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5784 transitions. [2025-03-16 20:03:42,061 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5784 transitions. Word has length 71 [2025-03-16 20:03:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5784 transitions. [2025-03-16 20:03:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5784 transitions. [2025-03-16 20:03:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:42,063 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] [2025-03-16 20:03:42,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:03:42,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1470659272, now seen corresponding path program 1 times [2025-03-16 20:03:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592119006] [2025-03-16 20:03:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:42,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:42,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:42,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:42,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:42,154 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-16 20:03:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592119006] [2025-03-16 20:03:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592119006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:42,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266853710] [2025-03-16 20:03:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:42,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:42,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:42,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:42,155 INFO L87 Difference]: Start difference. First operand 3321 states and 5784 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:42,363 INFO L93 Difference]: Finished difference Result 4628 states and 7824 transitions. [2025-03-16 20:03:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:42,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:42,376 INFO L225 Difference]: With dead ends: 4628 [2025-03-16 20:03:42,377 INFO L226 Difference]: Without dead ends: 3437 [2025-03-16 20:03:42,381 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-16 20:03:42,381 INFO L435 NwaCegarLoop]: 4106 mSDtfsCounter, 4220 mSDsluCounter, 8146 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 12252 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:42,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 12252 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2025-03-16 20:03:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3321. [2025-03-16 20:03:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7515943877551021) internal successors, (5493), 3158 states have internal predecessors, (5493), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5775 transitions. [2025-03-16 20:03:42,571 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5775 transitions. Word has length 71 [2025-03-16 20:03:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:42,571 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5775 transitions. [2025-03-16 20:03:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5775 transitions. [2025-03-16 20:03:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:42,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:42,573 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] [2025-03-16 20:03:42,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:03:42,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:42,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1908668775, now seen corresponding path program 1 times [2025-03-16 20:03:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679579285] [2025-03-16 20:03:42,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:42,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:42,641 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-16 20:03:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679579285] [2025-03-16 20:03:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679579285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:42,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:42,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389631633] [2025-03-16 20:03:42,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:42,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:42,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:42,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:42,642 INFO L87 Difference]: Start difference. First operand 3321 states and 5775 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:42,893 INFO L93 Difference]: Finished difference Result 4570 states and 7690 transitions. [2025-03-16 20:03:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:42,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:42,908 INFO L225 Difference]: With dead ends: 4570 [2025-03-16 20:03:42,908 INFO L226 Difference]: Without dead ends: 3379 [2025-03-16 20:03:42,913 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-16 20:03:42,914 INFO L435 NwaCegarLoop]: 4101 mSDtfsCounter, 4216 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 12238 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:42,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 12238 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-03-16 20:03:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3321. [2025-03-16 20:03:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7487244897959184) internal successors, (5484), 3158 states have internal predecessors, (5484), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:03:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5766 transitions. [2025-03-16 20:03:43,043 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5766 transitions. Word has length 71 [2025-03-16 20:03:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5766 transitions. [2025-03-16 20:03:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 20:03:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5766 transitions. [2025-03-16 20:03:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:03:43,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:43,046 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] [2025-03-16 20:03:43,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:03:43,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:43,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1617128506, now seen corresponding path program 1 times [2025-03-16 20:03:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373811899] [2025-03-16 20:03:43,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:43,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:03:43,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:03:43,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:43,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:03:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373811899] [2025-03-16 20:03:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373811899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:43,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:03:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525713028] [2025-03-16 20:03:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:43,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:03:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:43,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:03:43,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:03:43,096 INFO L87 Difference]: Start difference. First operand 3321 states and 5766 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:43,287 INFO L93 Difference]: Finished difference Result 5662 states and 9378 transitions. [2025-03-16 20:03:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2025-03-16 20:03:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:43,304 INFO L225 Difference]: With dead ends: 5662 [2025-03-16 20:03:43,304 INFO L226 Difference]: Without dead ends: 4472 [2025-03-16 20:03:43,310 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-16 20:03:43,310 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4320 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4320 SdHoareTripleChecker+Valid, 8631 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:43,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4320 Valid, 8631 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:03:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2025-03-16 20:03:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4463. [2025-03-16 20:03:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 4099 states have (on average 1.678702122468895) internal successors, (6881), 4150 states have internal predecessors, (6881), 214 states have call successors, (214), 108 states have call predecessors, (214), 148 states have return successors, (335), 212 states have call predecessors, (335), 214 states have call successors, (335) [2025-03-16 20:03:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 7430 transitions. [2025-03-16 20:03:43,450 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 7430 transitions. Word has length 71 [2025-03-16 20:03:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:43,451 INFO L471 AbstractCegarLoop]: Abstraction has 4463 states and 7430 transitions. [2025-03-16 20:03:43,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-16 20:03:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 7430 transitions. [2025-03-16 20:03:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:03:43,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:43,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:43,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:03:43,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:43,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2121085020, now seen corresponding path program 1 times [2025-03-16 20:03:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:43,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590816321] [2025-03-16 20:03:43,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:43,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590816321] [2025-03-16 20:03:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590816321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742066734] [2025-03-16 20:03:43,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:43,515 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-16 20:03:43,516 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-16 20:03:43,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:43,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:43,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:43,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:43,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:43,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 20:03:43,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742066734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393617902] [2025-03-16 20:03:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:43,664 INFO L87 Difference]: Start difference. First operand 4463 states and 7430 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 20:03:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:43,889 INFO L93 Difference]: Finished difference Result 9036 states and 14290 transitions. [2025-03-16 20:03:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 115 [2025-03-16 20:03:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:43,909 INFO L225 Difference]: With dead ends: 9036 [2025-03-16 20:03:43,909 INFO L226 Difference]: Without dead ends: 6704 [2025-03-16 20:03:43,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:43,917 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4126 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 4352 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-16 20:03:43,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6704 states. [2025-03-16 20:03:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6704 to 6684. [2025-03-16 20:03:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6684 states, 5980 states have (on average 1.6133779264214048) internal successors, (9648), 6080 states have internal predecessors, (9648), 406 states have call successors, (406), 216 states have call predecessors, (406), 296 states have return successors, (641), 395 states have call predecessors, (641), 406 states have call successors, (641) [2025-03-16 20:03:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6684 states to 6684 states and 10695 transitions. [2025-03-16 20:03:44,132 INFO L78 Accepts]: Start accepts. Automaton has 6684 states and 10695 transitions. Word has length 115 [2025-03-16 20:03:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:44,133 INFO L471 AbstractCegarLoop]: Abstraction has 6684 states and 10695 transitions. [2025-03-16 20:03:44,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 20:03:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6684 states and 10695 transitions. [2025-03-16 20:03:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:03:44,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:44,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:44,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:03:44,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:44,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 276231906, now seen corresponding path program 1 times [2025-03-16 20:03:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218389617] [2025-03-16 20:03:44,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:44,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:44,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:44,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218389617] [2025-03-16 20:03:44,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218389617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993269782] [2025-03-16 20:03:44,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:44,406 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-16 20:03:44,407 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-16 20:03:44,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:44,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:44,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:03:44,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993269782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704855518] [2025-03-16 20:03:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:44,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:44,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:44,563 INFO L87 Difference]: Start difference. First operand 6684 states and 10695 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-16 20:03:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:44,918 INFO L93 Difference]: Finished difference Result 15657 states and 24105 transitions. [2025-03-16 20:03:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 115 [2025-03-16 20:03:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:44,950 INFO L225 Difference]: With dead ends: 15657 [2025-03-16 20:03:44,950 INFO L226 Difference]: Without dead ends: 11104 [2025-03-16 20:03:44,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:44,962 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4121 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4352 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-16 20:03:44,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2025-03-16 20:03:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 11066. [2025-03-16 20:03:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 9684 states have (on average 1.5561751342420487) internal successors, (15070), 9882 states have internal predecessors, (15070), 788 states have call successors, (788), 432 states have call predecessors, (788), 592 states have return successors, (1251), 759 states have call predecessors, (1251), 788 states have call successors, (1251) [2025-03-16 20:03:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 17109 transitions. [2025-03-16 20:03:45,321 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 17109 transitions. Word has length 115 [2025-03-16 20:03:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:45,321 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 17109 transitions. [2025-03-16 20:03:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-16 20:03:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 17109 transitions. [2025-03-16 20:03:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:03:45,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:45,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:45,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:03:45,533 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,SelfDestructingSolverStorable9 [2025-03-16 20:03:45,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1767945372, now seen corresponding path program 1 times [2025-03-16 20:03:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298932652] [2025-03-16 20:03:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:45,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298932652] [2025-03-16 20:03:45,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298932652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:45,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741538003] [2025-03-16 20:03:45,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:45,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:45,593 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-16 20:03:45,594 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-16 20:03:45,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:45,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:45,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 20:03:45,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741538003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:03:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342096529] [2025-03-16 20:03:45,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:45,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:45,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:45,733 INFO L87 Difference]: Start difference. First operand 11066 states and 17109 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 20:03:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:46,281 INFO L93 Difference]: Finished difference Result 28575 states and 43145 transitions. [2025-03-16 20:03:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 115 [2025-03-16 20:03:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:46,352 INFO L225 Difference]: With dead ends: 28575 [2025-03-16 20:03:46,352 INFO L226 Difference]: Without dead ends: 19640 [2025-03-16 20:03:46,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:46,450 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4131 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 4352 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-16 20:03:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19640 states. [2025-03-16 20:03:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19640 to 19566. [2025-03-16 20:03:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19566 states, 16880 states have (on average 1.5162322274881517) internal successors, (25594), 17274 states have internal predecessors, (25594), 1500 states have call successors, (1500), 864 states have call predecessors, (1500), 1184 states have return successors, (2419), 1435 states have call predecessors, (2419), 1500 states have call successors, (2419) [2025-03-16 20:03:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 29513 transitions. [2025-03-16 20:03:47,539 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 29513 transitions. Word has length 115 [2025-03-16 20:03:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 19566 states and 29513 transitions. [2025-03-16 20:03:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 20:03:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 29513 transitions. [2025-03-16 20:03:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:03:47,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:47,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:03:47,585 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-16 20:03:47,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:47,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2032931286, now seen corresponding path program 1 times [2025-03-16 20:03:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003189075] [2025-03-16 20:03:47,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:47,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:47,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:47,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:47,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:03:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:47,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003189075] [2025-03-16 20:03:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003189075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:47,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068082135] [2025-03-16 20:03:47,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:47,843 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-16 20:03:47,846 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-16 20:03:47,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:03:47,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:03:47,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:47,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:47,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:03:47,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068082135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:47,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86145804] [2025-03-16 20:03:47,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:47,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:47,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:47,962 INFO L87 Difference]: Start difference. First operand 19566 states and 29513 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-03-16 20:03:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:49,092 INFO L93 Difference]: Finished difference Result 53425 states and 80111 transitions. [2025-03-16 20:03:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) Word has length 115 [2025-03-16 20:03:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:49,221 INFO L225 Difference]: With dead ends: 53425 [2025-03-16 20:03:49,221 INFO L226 Difference]: Without dead ends: 35991 [2025-03-16 20:03:49,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:49,264 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 184 mSDsluCounter, 4165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 8519 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:49,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 8519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35991 states. [2025-03-16 20:03:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35991 to 35991. [2025-03-16 20:03:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 30818 states have (on average 1.4894866636381336) internal successors, (45903), 31533 states have internal predecessors, (45903), 2829 states have call successors, (2829), 1702 states have call predecessors, (2829), 2342 states have return successors, (5130), 2771 states have call predecessors, (5130), 2829 states have call successors, (5130) [2025-03-16 20:03:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 53862 transitions. [2025-03-16 20:03:50,629 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 53862 transitions. Word has length 115 [2025-03-16 20:03:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:50,629 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 53862 transitions. [2025-03-16 20:03:50,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-03-16 20:03:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 53862 transitions. [2025-03-16 20:03:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:03:50,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:50,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:03:50,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:03:50,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:50,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash 222330261, now seen corresponding path program 1 times [2025-03-16 20:03:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6447764] [2025-03-16 20:03:50,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:50,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:50,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:50,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 20:03:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6447764] [2025-03-16 20:03:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6447764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538345145] [2025-03-16 20:03:50,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:50,992 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-16 20:03:50,994 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-16 20:03:51,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:51,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:51,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:51,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:51,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:51,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:03:51,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538345145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:51,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003969755] [2025-03-16 20:03:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:51,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:51,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:51,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:51,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:51,336 INFO L87 Difference]: Start difference. First operand 35991 states and 53862 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:52,948 INFO L93 Difference]: Finished difference Result 58683 states and 87865 transitions. [2025-03-16 20:03:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 166 [2025-03-16 20:03:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:53,092 INFO L225 Difference]: With dead ends: 58683 [2025-03-16 20:03:53,093 INFO L226 Difference]: Without dead ends: 31719 [2025-03-16 20:03:53,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:53,174 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4100 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 4203 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:53,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4100 Valid, 4203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31719 states. [2025-03-16 20:03:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31719 to 24287. [2025-03-16 20:03:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24287 states, 21050 states have (on average 1.456104513064133) internal successors, (30651), 21289 states have internal predecessors, (30651), 1849 states have call successors, (1849), 1194 states have call predecessors, (1849), 1386 states have return successors, (2610), 1811 states have call predecessors, (2610), 1849 states have call successors, (2610) [2025-03-16 20:03:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24287 states to 24287 states and 35110 transitions. [2025-03-16 20:03:54,270 INFO L78 Accepts]: Start accepts. Automaton has 24287 states and 35110 transitions. Word has length 166 [2025-03-16 20:03:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:54,271 INFO L471 AbstractCegarLoop]: Abstraction has 24287 states and 35110 transitions. [2025-03-16 20:03:54,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 24287 states and 35110 transitions. [2025-03-16 20:03:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:03:54,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:54,300 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:03:54,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:03:54,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 20:03:54,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1820960332, now seen corresponding path program 1 times [2025-03-16 20:03:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202969395] [2025-03-16 20:03:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:54,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:54,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:03:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202969395] [2025-03-16 20:03:54,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202969395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121128133] [2025-03-16 20:03:54,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:54,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:54,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:03:54,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:03:54,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:54,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:54,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:54,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:54,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:03:54,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:03:54,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121128133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018683112] [2025-03-16 20:03:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:54,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:54,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:54,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:54,942 INFO L87 Difference]: Start difference. First operand 24287 states and 35110 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:55,688 INFO L93 Difference]: Finished difference Result 48785 states and 70367 transitions. [2025-03-16 20:03:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 166 [2025-03-16 20:03:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:55,783 INFO L225 Difference]: With dead ends: 48785 [2025-03-16 20:03:55,783 INFO L226 Difference]: Without dead ends: 26637 [2025-03-16 20:03:55,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:55,831 INFO L435 NwaCegarLoop]: 4161 mSDtfsCounter, 4116 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:55,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 4200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2025-03-16 20:03:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 26637. [2025-03-16 20:03:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23180 states have (on average 1.4186798964624676) internal successors, (32885), 23419 states have internal predecessors, (32885), 1915 states have call successors, (1915), 1348 states have call predecessors, (1915), 1540 states have return successors, (2698), 1877 states have call predecessors, (2698), 1915 states have call successors, (2698) [2025-03-16 20:03:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 37498 transitions. [2025-03-16 20:03:57,004 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 37498 transitions. Word has length 166 [2025-03-16 20:03:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:57,005 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 37498 transitions. [2025-03-16 20:03:57,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:03:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 37498 transitions. [2025-03-16 20:03:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:03:57,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:57,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:03:57,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:03:57,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:57,238 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:57,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1606112111, now seen corresponding path program 1 times [2025-03-16 20:03:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:57,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937621246] [2025-03-16 20:03:57,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:57,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:57,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:57,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:03:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937621246] [2025-03-16 20:03:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937621246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:03:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143856539] [2025-03-16 20:03:57,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:03:57,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:03:57,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:03:57,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:03:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:03:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:03:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:57,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 20:03:57,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:03:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 20:03:57,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:03:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143856539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:57,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:03:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:03:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713805514] [2025-03-16 20:03:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:03:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:03:57,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:57,486 INFO L87 Difference]: Start difference. First operand 26637 states and 37498 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:03:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:58,899 INFO L93 Difference]: Finished difference Result 47360 states and 65604 transitions. [2025-03-16 20:03:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:03:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-03-16 20:03:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:59,004 INFO L225 Difference]: With dead ends: 47360 [2025-03-16 20:03:59,004 INFO L226 Difference]: Without dead ends: 28745 [2025-03-16 20:03:59,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:59,051 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4106 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:59,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:03:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28745 states. [2025-03-16 20:04:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28745 to 28613. [2025-03-16 20:04:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28613 states, 24980 states have (on average 1.393634907926341) internal successors, (34813), 25219 states have internal predecessors, (34813), 1959 states have call successors, (1959), 1480 states have call predecessors, (1959), 1672 states have return successors, (2874), 1921 states have call predecessors, (2874), 1959 states have call successors, (2874) [2025-03-16 20:04:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28613 states to 28613 states and 39646 transitions. [2025-03-16 20:04:00,421 INFO L78 Accepts]: Start accepts. Automaton has 28613 states and 39646 transitions. Word has length 166 [2025-03-16 20:04:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:00,422 INFO L471 AbstractCegarLoop]: Abstraction has 28613 states and 39646 transitions. [2025-03-16 20:04:00,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:04:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 28613 states and 39646 transitions. [2025-03-16 20:04:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:04:00,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:00,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:04:00,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:04:00,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:00,653 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:00,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1302436547, now seen corresponding path program 1 times [2025-03-16 20:04:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:00,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009092740] [2025-03-16 20:04:00,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:00,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:04:00,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:04:00,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:00,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 20:04:00,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:00,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009092740] [2025-03-16 20:04:00,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009092740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:00,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563256353] [2025-03-16 20:04:00,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:00,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:04:00,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:04:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:04:00,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:04:00,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:00,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:00,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:00,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:04:00,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563256353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753051738] [2025-03-16 20:04:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:00,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:00,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:00,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:00,855 INFO L87 Difference]: Start difference. First operand 28613 states and 39646 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:02,790 INFO L93 Difference]: Finished difference Result 78377 states and 108092 transitions. [2025-03-16 20:04:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2025-03-16 20:04:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:02,960 INFO L225 Difference]: With dead ends: 78377 [2025-03-16 20:04:02,960 INFO L226 Difference]: Without dead ends: 51903 [2025-03-16 20:04:03,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:03,009 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 166 mSDsluCounter, 4157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:03,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 8500 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51903 states. [2025-03-16 20:04:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51903 to 51901. [2025-03-16 20:04:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51901 states, 44958 states have (on average 1.3679211708705903) internal successors, (61499), 45435 states have internal predecessors, (61499), 3757 states have call successors, (3757), 2800 states have call predecessors, (3757), 3184 states have return successors, (6658), 3681 states have call predecessors, (6658), 3757 states have call successors, (6658) [2025-03-16 20:04:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51901 states to 51901 states and 71914 transitions. [2025-03-16 20:04:05,324 INFO L78 Accepts]: Start accepts. Automaton has 51901 states and 71914 transitions. Word has length 167 [2025-03-16 20:04:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:05,325 INFO L471 AbstractCegarLoop]: Abstraction has 51901 states and 71914 transitions. [2025-03-16 20:04:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51901 states and 71914 transitions. [2025-03-16 20:04:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:04:05,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:05,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:04:05,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:04:05,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:04:05,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:05,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1406015388, now seen corresponding path program 1 times [2025-03-16 20:04:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67284844] [2025-03-16 20:04:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:05,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:05,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:05,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:05,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 20:04:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67284844] [2025-03-16 20:04:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67284844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170663272] [2025-03-16 20:04:05,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:05,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:05,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:05,651 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:04:05,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 20:04:05,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:05,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:05,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:05,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 20:04:05,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170663272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961376502] [2025-03-16 20:04:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:05,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:05,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:05,798 INFO L87 Difference]: Start difference. First operand 51901 states and 71914 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:07,947 INFO L93 Difference]: Finished difference Result 105079 states and 146903 transitions. [2025-03-16 20:04:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2025-03-16 20:04:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:08,187 INFO L225 Difference]: With dead ends: 105079 [2025-03-16 20:04:08,188 INFO L226 Difference]: Without dead ends: 55325 [2025-03-16 20:04:08,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:08,307 INFO L435 NwaCegarLoop]: 4169 mSDtfsCounter, 4124 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4124 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:08,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4124 Valid, 4207 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55325 states. [2025-03-16 20:04:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55325 to 51901. [2025-03-16 20:04:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51901 states, 44958 states have (on average 1.3419413674985543) internal successors, (60331), 45435 states have internal predecessors, (60331), 3757 states have call successors, (3757), 2800 states have call predecessors, (3757), 3184 states have return successors, (6262), 3681 states have call predecessors, (6262), 3757 states have call successors, (6262) [2025-03-16 20:04:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51901 states to 51901 states and 70350 transitions. [2025-03-16 20:04:10,774 INFO L78 Accepts]: Start accepts. Automaton has 51901 states and 70350 transitions. Word has length 168 [2025-03-16 20:04:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 51901 states and 70350 transitions. [2025-03-16 20:04:10,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 51901 states and 70350 transitions. [2025-03-16 20:04:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:04:10,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:10,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:04:10,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 20:04:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 20:04:11,018 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 853739394, now seen corresponding path program 1 times [2025-03-16 20:04:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081743598] [2025-03-16 20:04:11,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:11,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:11,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:11,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 20:04:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081743598] [2025-03-16 20:04:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081743598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712662551] [2025-03-16 20:04:11,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:11,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:04:11,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 20:04:11,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:11,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:11,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:11,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:11,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 20:04:11,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712662551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645700264] [2025-03-16 20:04:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:11,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:11,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:11,196 INFO L87 Difference]: Start difference. First operand 51901 states and 70350 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:15,265 INFO L93 Difference]: Finished difference Result 148789 states and 201958 transitions. [2025-03-16 20:04:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:04:15,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2025-03-16 20:04:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:15,678 INFO L225 Difference]: With dead ends: 148789 [2025-03-16 20:04:15,678 INFO L226 Difference]: Without dead ends: 99035 [2025-03-16 20:04:15,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:15,791 INFO L435 NwaCegarLoop]: 4342 mSDtfsCounter, 176 mSDsluCounter, 4155 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 8497 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:15,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 8497 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:04:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99035 states. [2025-03-16 20:04:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99035 to 99033. [2025-03-16 20:04:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99033 states, 85678 states have (on average 1.320934195476085) internal successors, (113175), 86631 states have internal predecessors, (113175), 7161 states have call successors, (7161), 5424 states have call predecessors, (7161), 6192 states have return successors, (14236), 7009 states have call predecessors, (14236), 7161 states have call successors, (14236) [2025-03-16 20:04:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99033 states to 99033 states and 134572 transitions. [2025-03-16 20:04:20,099 INFO L78 Accepts]: Start accepts. Automaton has 99033 states and 134572 transitions. Word has length 168 [2025-03-16 20:04:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 99033 states and 134572 transitions. [2025-03-16 20:04:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:04:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 99033 states and 134572 transitions. [2025-03-16 20:04:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:04:20,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:20,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:04:20,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 20:04:20,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:04:20,415 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash -595236319, now seen corresponding path program 1 times [2025-03-16 20:04:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491586093] [2025-03-16 20:04:20,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:20,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:20,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:20,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:20,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-16 20:04:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:20,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491586093] [2025-03-16 20:04:20,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491586093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:04:20,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763039584] [2025-03-16 20:04:20,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:20,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:04:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:20,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:04:20,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 20:04:20,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:04:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:04:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:20,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:04:20,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:04:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 20:04:20,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:04:20,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763039584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:20,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:04:20,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:04:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630931702] [2025-03-16 20:04:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:04:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:04:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:20,652 INFO L87 Difference]: Start difference. First operand 99033 states and 134572 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)