./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:13:23,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:13:23,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:13:23,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:13:23,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:13:23,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:13:23,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:13:23,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:13:23,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:13:23,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:13:23,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:13:23,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:13:23,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:13:23,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:13:23,935 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:13:23,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:13:23,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:13:23,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:13:23,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:13:23,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:13:23,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 [2025-02-05 17:13:24,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:13:24,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:13:24,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:13:24,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:13:24,187 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:13:24,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-02-05 17:13:25,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9e5ac836/648db0027e084613b7b7560e148082ce/FLAG8b0ddec9e [2025-02-05 17:13:25,912 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:13:25,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-02-05 17:13:25,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9e5ac836/648db0027e084613b7b7560e148082ce/FLAG8b0ddec9e [2025-02-05 17:13:26,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9e5ac836/648db0027e084613b7b7560e148082ce [2025-02-05 17:13:26,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:13:26,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:13:26,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:13:26,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:13:26,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:13:26,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:13:26" (1/1) ... [2025-02-05 17:13:26,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d944d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:26, skipping insertion in model container [2025-02-05 17:13:26,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:13:26" (1/1) ... [2025-02-05 17:13:26,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:13:27,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c[380323,380336] [2025-02-05 17:13:27,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c[383339,383352] [2025-02-05 17:13:28,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:13:28,022 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:13:28,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c[380323,380336] [2025-02-05 17:13:28,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c[383339,383352] [2025-02-05 17:13:28,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:13:28,587 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:13:28,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28 WrapperNode [2025-02-05 17:13:28,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:13:28,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:13:28,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:13:28,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:13:28,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:28,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,027 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-02-05 17:13:29,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:13:29,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:13:29,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:13:29,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:13:29,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,329 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:13:29,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:13:29,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:13:29,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:13:29,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:13:29,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (1/1) ... [2025-02-05 17:13:29,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:13:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:29,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:13:29,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:13:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:13:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:13:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:13:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:13:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:13:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:13:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:13:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:13:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:13:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:13:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:13:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:13:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:13:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:13:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:13:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:13:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:13:29,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:13:29,741 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:13:29,742 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:13:36,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:13:36,126 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:13:36,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:13:36,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:13:36,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:13:36,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:13:36,128 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:13:36,308 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2025-02-05 17:13:36,308 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:13:36,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:13:36,366 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:13:36,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:13:36 BoogieIcfgContainer [2025-02-05 17:13:36,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:13:36,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:13:36,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:13:36,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:13:36,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:13:26" (1/3) ... [2025-02-05 17:13:36,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130a36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:13:36, skipping insertion in model container [2025-02-05 17:13:36,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:13:28" (2/3) ... [2025-02-05 17:13:36,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130a36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:13:36, skipping insertion in model container [2025-02-05 17:13:36,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:13:36" (3/3) ... [2025-02-05 17:13:36,375 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.09.cil-2.c [2025-02-05 17:13:36,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:13:36,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.09.cil-2.c that has 8 procedures, 2518 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:13:36,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:13:36,605 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;@50b92690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:13:36,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:13:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 2518 states, 2483 states have (on average 1.8352799033427305) internal successors, (4557), 2488 states have internal predecessors, (4557), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:13:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:36,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:36,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:36,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 131631439, now seen corresponding path program 1 times [2025-02-05 17:13:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511646139] [2025-02-05 17:13:36,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:36,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511646139] [2025-02-05 17:13:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511646139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:13:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557743117] [2025-02-05 17:13:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:37,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:13:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:37,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:13:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:13:37,313 INFO L87 Difference]: Start difference. First operand has 2518 states, 2483 states have (on average 1.8352799033427305) internal successors, (4557), 2488 states have internal predecessors, (4557), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:38,416 INFO L93 Difference]: Finished difference Result 5369 states and 9751 transitions. [2025-02-05 17:13:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:13:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:38,443 INFO L225 Difference]: With dead ends: 5369 [2025-02-05 17:13:38,443 INFO L226 Difference]: Without dead ends: 2798 [2025-02-05 17:13:38,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:38,467 INFO L435 NwaCegarLoop]: 4425 mSDtfsCounter, 4955 mSDsluCounter, 9078 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4972 SdHoareTripleChecker+Valid, 13503 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:38,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4972 Valid, 13503 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:13:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-02-05 17:13:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2773. [2025-02-05 17:13:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2715 states have (on average 1.796316758747698) internal successors, (4877), 2719 states have internal predecessors, (4877), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:13:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4962 transitions. [2025-02-05 17:13:38,627 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4962 transitions. Word has length 146 [2025-02-05 17:13:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:38,627 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4962 transitions. [2025-02-05 17:13:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4962 transitions. [2025-02-05 17:13:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:38,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:38,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:38,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:13:38,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:38,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1378382285, now seen corresponding path program 1 times [2025-02-05 17:13:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:38,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580536588] [2025-02-05 17:13:38,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:38,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:38,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:38,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580536588] [2025-02-05 17:13:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580536588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:38,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:13:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896505901] [2025-02-05 17:13:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:13:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:38,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:13:38,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:13:38,874 INFO L87 Difference]: Start difference. First operand 2773 states and 4962 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:39,328 INFO L93 Difference]: Finished difference Result 3468 states and 6055 transitions. [2025-02-05 17:13:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:13:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:39,342 INFO L225 Difference]: With dead ends: 3468 [2025-02-05 17:13:39,342 INFO L226 Difference]: Without dead ends: 2833 [2025-02-05 17:13:39,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:39,357 INFO L435 NwaCegarLoop]: 4344 mSDtfsCounter, 4627 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 12903 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:39,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 12903 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:13:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2025-02-05 17:13:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2773. [2025-02-05 17:13:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2715 states have (on average 1.7955801104972375) internal successors, (4875), 2719 states have internal predecessors, (4875), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:13:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4960 transitions. [2025-02-05 17:13:39,659 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4960 transitions. Word has length 146 [2025-02-05 17:13:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:39,660 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4960 transitions. [2025-02-05 17:13:39,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4960 transitions. [2025-02-05 17:13:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:39,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:39,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:39,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:13:39,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1122399666, now seen corresponding path program 1 times [2025-02-05 17:13:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145267555] [2025-02-05 17:13:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:39,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:39,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:39,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:39,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145267555] [2025-02-05 17:13:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145267555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:39,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702528036] [2025-02-05 17:13:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:39,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:39,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:39,826 INFO L87 Difference]: Start difference. First operand 2773 states and 4960 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:40,424 INFO L93 Difference]: Finished difference Result 3810 states and 6579 transitions. [2025-02-05 17:13:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:40,436 INFO L225 Difference]: With dead ends: 3810 [2025-02-05 17:13:40,436 INFO L226 Difference]: Without dead ends: 3175 [2025-02-05 17:13:40,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:40,439 INFO L435 NwaCegarLoop]: 4629 mSDtfsCounter, 4883 mSDsluCounter, 13936 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4900 SdHoareTripleChecker+Valid, 18565 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:40,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4900 Valid, 18565 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2025-02-05 17:13:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3074. [2025-02-05 17:13:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2991 states have (on average 1.7696422601136743) internal successors, (5293), 2996 states have internal predecessors, (5293), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:13:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 5417 transitions. [2025-02-05 17:13:40,558 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 5417 transitions. Word has length 146 [2025-02-05 17:13:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 5417 transitions. [2025-02-05 17:13:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 5417 transitions. [2025-02-05 17:13:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:40,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:40,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:13:40,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash -648880723, now seen corresponding path program 1 times [2025-02-05 17:13:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272563541] [2025-02-05 17:13:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:40,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:40,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:40,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272563541] [2025-02-05 17:13:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272563541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:40,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24852610] [2025-02-05 17:13:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:40,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:40,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:40,761 INFO L87 Difference]: Start difference. First operand 3074 states and 5417 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:41,451 INFO L93 Difference]: Finished difference Result 4754 states and 8031 transitions. [2025-02-05 17:13:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:41,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:41,472 INFO L225 Difference]: With dead ends: 4754 [2025-02-05 17:13:41,472 INFO L226 Difference]: Without dead ends: 3818 [2025-02-05 17:13:41,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:41,478 INFO L435 NwaCegarLoop]: 4621 mSDtfsCounter, 4875 mSDsluCounter, 13914 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 18535 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:41,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 18535 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2025-02-05 17:13:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3708. [2025-02-05 17:13:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3573 states have (on average 1.7313182199832073) internal successors, (6186), 3582 states have internal predecessors, (6186), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:13:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 6394 transitions. [2025-02-05 17:13:41,597 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 6394 transitions. Word has length 146 [2025-02-05 17:13:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 6394 transitions. [2025-02-05 17:13:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 6394 transitions. [2025-02-05 17:13:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:41,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:41,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:41,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:13:41,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 473398476, now seen corresponding path program 1 times [2025-02-05 17:13:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:41,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5303390] [2025-02-05 17:13:41,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:41,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:41,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:41,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:41,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:41,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5303390] [2025-02-05 17:13:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5303390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:41,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:41,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:41,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456462407] [2025-02-05 17:13:41,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:41,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:41,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:41,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:41,720 INFO L87 Difference]: Start difference. First operand 3708 states and 6394 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:42,368 INFO L93 Difference]: Finished difference Result 6776 states and 11206 transitions. [2025-02-05 17:13:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:42,392 INFO L225 Difference]: With dead ends: 6776 [2025-02-05 17:13:42,393 INFO L226 Difference]: Without dead ends: 5206 [2025-02-05 17:13:42,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:42,402 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 4870 mSDsluCounter, 13905 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 18523 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:42,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 18523 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-02-05 17:13:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5069. [2025-02-05 17:13:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4824 states have (on average 1.6869817578772803) internal successors, (8138), 4847 states have internal predecessors, (8138), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:13:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8538 transitions. [2025-02-05 17:13:42,557 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8538 transitions. Word has length 146 [2025-02-05 17:13:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8538 transitions. [2025-02-05 17:13:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8538 transitions. [2025-02-05 17:13:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:42,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:42,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:13:42,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1430061619, now seen corresponding path program 1 times [2025-02-05 17:13:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808187078] [2025-02-05 17:13:42,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:42,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:42,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:42,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:42,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808187078] [2025-02-05 17:13:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808187078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:42,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:42,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321792674] [2025-02-05 17:13:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:42,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:42,759 INFO L87 Difference]: Start difference. First operand 5069 states and 8538 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:43,462 INFO L93 Difference]: Finished difference Result 11173 states and 18304 transitions. [2025-02-05 17:13:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:43,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:43,508 INFO L225 Difference]: With dead ends: 11173 [2025-02-05 17:13:43,509 INFO L226 Difference]: Without dead ends: 8242 [2025-02-05 17:13:43,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:43,519 INFO L435 NwaCegarLoop]: 4615 mSDtfsCounter, 4865 mSDsluCounter, 13896 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 18511 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:43,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4882 Valid, 18511 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8242 states. [2025-02-05 17:13:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8242 to 8052. [2025-02-05 17:13:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6522658211124324) internal successors, (12506), 7638 states have internal predecessors, (12506), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:13:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13386 transitions. [2025-02-05 17:13:43,722 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13386 transitions. Word has length 146 [2025-02-05 17:13:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:43,722 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13386 transitions. [2025-02-05 17:13:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13386 transitions. [2025-02-05 17:13:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:43,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:43,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:13:43,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 171104428, now seen corresponding path program 1 times [2025-02-05 17:13:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974975322] [2025-02-05 17:13:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:43,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:43,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:43,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:43,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974975322] [2025-02-05 17:13:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974975322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:13:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178349395] [2025-02-05 17:13:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:43,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:13:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:43,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:13:43,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:13:43,822 INFO L87 Difference]: Start difference. First operand 8052 states and 13386 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:44,239 INFO L93 Difference]: Finished difference Result 15128 states and 25152 transitions. [2025-02-05 17:13:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:13:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:44,263 INFO L225 Difference]: With dead ends: 15128 [2025-02-05 17:13:44,263 INFO L226 Difference]: Without dead ends: 9214 [2025-02-05 17:13:44,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:44,277 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4619 mSDsluCounter, 8534 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4636 SdHoareTripleChecker+Valid, 12865 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:44,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4636 Valid, 12865 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:13:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9214 states. [2025-02-05 17:13:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9214 to 8052. [2025-02-05 17:13:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6500198176773682) internal successors, (12489), 7638 states have internal predecessors, (12489), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:13:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13369 transitions. [2025-02-05 17:13:44,494 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13369 transitions. Word has length 146 [2025-02-05 17:13:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13369 transitions. [2025-02-05 17:13:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13369 transitions. [2025-02-05 17:13:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:44,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:44,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:44,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:13:44,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:44,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -469981715, now seen corresponding path program 1 times [2025-02-05 17:13:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:44,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416278360] [2025-02-05 17:13:44,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:44,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:44,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416278360] [2025-02-05 17:13:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416278360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:13:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559073028] [2025-02-05 17:13:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:13:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:44,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:13:44,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:13:44,598 INFO L87 Difference]: Start difference. First operand 8052 states and 13369 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:44,966 INFO L93 Difference]: Finished difference Result 15045 states and 24952 transitions. [2025-02-05 17:13:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:13:44,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:44,994 INFO L225 Difference]: With dead ends: 15045 [2025-02-05 17:13:44,995 INFO L226 Difference]: Without dead ends: 9131 [2025-02-05 17:13:45,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:45,011 INFO L435 NwaCegarLoop]: 4328 mSDtfsCounter, 4616 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 12857 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:45,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 12857 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:13:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2025-02-05 17:13:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 8052. [2025-02-05 17:13:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8052 states, 7569 states have (on average 1.6477738142423042) internal successors, (12472), 7638 states have internal predecessors, (12472), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:13:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 13352 transitions. [2025-02-05 17:13:45,247 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 13352 transitions. Word has length 146 [2025-02-05 17:13:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 8052 states and 13352 transitions. [2025-02-05 17:13:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 13352 transitions. [2025-02-05 17:13:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:45,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:45,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:45,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:13:45,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:45,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 756264076, now seen corresponding path program 1 times [2025-02-05 17:13:45,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:45,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764066310] [2025-02-05 17:13:45,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:45,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:45,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:45,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:45,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764066310] [2025-02-05 17:13:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764066310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284467816] [2025-02-05 17:13:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:45,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:45,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:45,359 INFO L87 Difference]: Start difference. First operand 8052 states and 13352 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:46,139 INFO L93 Difference]: Finished difference Result 20752 states and 34220 transitions. [2025-02-05 17:13:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:46,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:46,181 INFO L225 Difference]: With dead ends: 20752 [2025-02-05 17:13:46,181 INFO L226 Difference]: Without dead ends: 14838 [2025-02-05 17:13:46,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:46,196 INFO L435 NwaCegarLoop]: 4602 mSDtfsCounter, 4844 mSDsluCounter, 13859 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4861 SdHoareTripleChecker+Valid, 18461 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:46,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4861 Valid, 18461 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14838 states. [2025-02-05 17:13:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14838 to 14585. [2025-02-05 17:13:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14585 states, 13572 states have (on average 1.6312997347480107) internal successors, (22140), 13787 states have internal predecessors, (22140), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:13:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14585 states to 14585 states and 24364 transitions. [2025-02-05 17:13:46,648 INFO L78 Accepts]: Start accepts. Automaton has 14585 states and 24364 transitions. Word has length 146 [2025-02-05 17:13:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:46,648 INFO L471 AbstractCegarLoop]: Abstraction has 14585 states and 24364 transitions. [2025-02-05 17:13:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 14585 states and 24364 transitions. [2025-02-05 17:13:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:46,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:46,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:46,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:13:46,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2042746381, now seen corresponding path program 1 times [2025-02-05 17:13:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559764928] [2025-02-05 17:13:46,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:46,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:46,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:46,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:46,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559764928] [2025-02-05 17:13:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559764928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:46,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863454946] [2025-02-05 17:13:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:46,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:46,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:46,772 INFO L87 Difference]: Start difference. First operand 14585 states and 24364 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:47,816 INFO L93 Difference]: Finished difference Result 44385 states and 75335 transitions. [2025-02-05 17:13:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:47,932 INFO L225 Difference]: With dead ends: 44385 [2025-02-05 17:13:47,932 INFO L226 Difference]: Without dead ends: 31938 [2025-02-05 17:13:47,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:47,973 INFO L435 NwaCegarLoop]: 4597 mSDtfsCounter, 5123 mSDsluCounter, 13839 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 18436 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:47,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 18436 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31938 states. [2025-02-05 17:13:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31938 to 29256. [2025-02-05 17:13:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29256 states, 27053 states have (on average 1.63796991091561) internal successors, (44312), 27722 states have internal predecessors, (44312), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-02-05 17:13:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29256 states to 29256 states and 50696 transitions. [2025-02-05 17:13:48,936 INFO L78 Accepts]: Start accepts. Automaton has 29256 states and 50696 transitions. Word has length 146 [2025-02-05 17:13:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 29256 states and 50696 transitions. [2025-02-05 17:13:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29256 states and 50696 transitions. [2025-02-05 17:13:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:48,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:48,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:48,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:13:48,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash -271058836, now seen corresponding path program 1 times [2025-02-05 17:13:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633021523] [2025-02-05 17:13:48,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:48,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:48,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:48,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:48,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633021523] [2025-02-05 17:13:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633021523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:49,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:49,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:13:49,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970231568] [2025-02-05 17:13:49,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:49,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:13:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:49,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:13:49,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:49,064 INFO L87 Difference]: Start difference. First operand 29256 states and 50696 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:51,522 INFO L93 Difference]: Finished difference Result 93784 states and 169213 transitions. [2025-02-05 17:13:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:13:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:51,781 INFO L225 Difference]: With dead ends: 93784 [2025-02-05 17:13:51,781 INFO L226 Difference]: Without dead ends: 66666 [2025-02-05 17:13:51,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:13:51,853 INFO L435 NwaCegarLoop]: 4590 mSDtfsCounter, 5055 mSDsluCounter, 13820 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 18410 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:51,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 18410 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:13:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66666 states. [2025-02-05 17:13:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66666 to 62390. [2025-02-05 17:13:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6542813802242253) internal successors, (94878), 59416 states have internal predecessors, (94878), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:13:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115662 transitions. [2025-02-05 17:13:54,415 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115662 transitions. Word has length 146 [2025-02-05 17:13:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:54,416 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115662 transitions. [2025-02-05 17:13:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115662 transitions. [2025-02-05 17:13:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:13:54,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:13:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:13:54,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1417599349, now seen corresponding path program 1 times [2025-02-05 17:13:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128266006] [2025-02-05 17:13:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:13:54,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:13:54,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:54,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:13:54,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:54,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128266006] [2025-02-05 17:13:54,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128266006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:54,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:13:54,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:13:54,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918956118] [2025-02-05 17:13:54,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:54,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:13:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:54,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:13:54,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:13:54,519 INFO L87 Difference]: Start difference. First operand 62390 states and 115662 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:13:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:57,442 INFO L93 Difference]: Finished difference Result 140154 states and 272438 transitions. [2025-02-05 17:13:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:13:57,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:13:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:57,845 INFO L225 Difference]: With dead ends: 140154 [2025-02-05 17:13:57,845 INFO L226 Difference]: Without dead ends: 79902 [2025-02-05 17:13:58,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:58,027 INFO L435 NwaCegarLoop]: 4317 mSDtfsCounter, 4607 mSDsluCounter, 8506 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 12823 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:58,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 12823 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:13:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79902 states. [2025-02-05 17:14:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79902 to 62390. [2025-02-05 17:14:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6520321517618957) internal successors, (94749), 59416 states have internal predecessors, (94749), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:14:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115533 transitions. [2025-02-05 17:14:01,292 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115533 transitions. Word has length 146 [2025-02-05 17:14:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:14:01,294 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115533 transitions. [2025-02-05 17:14:01,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:14:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115533 transitions. [2025-02-05 17:14:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:14:01,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:14:01,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:14:01,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:14:01,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:14:01,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:14:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1593456780, now seen corresponding path program 1 times [2025-02-05 17:14:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:14:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31110864] [2025-02-05 17:14:01,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:14:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:14:01,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:14:01,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:14:01,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:14:01,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:14:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:14:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:14:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31110864] [2025-02-05 17:14:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31110864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:14:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:14:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:14:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598917758] [2025-02-05 17:14:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:14:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:14:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:14:01,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:14:01,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:14:01,392 INFO L87 Difference]: Start difference. First operand 62390 states and 115533 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:14:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:14:04,518 INFO L93 Difference]: Finished difference Result 137965 states and 267802 transitions. [2025-02-05 17:14:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:14:04,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:14:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:14:04,835 INFO L225 Difference]: With dead ends: 137965 [2025-02-05 17:14:04,835 INFO L226 Difference]: Without dead ends: 77713 [2025-02-05 17:14:04,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:14:04,985 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4604 mSDsluCounter, 8501 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 12815 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:14:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 12815 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:14:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77713 states. [2025-02-05 17:14:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77713 to 62390. [2025-02-05 17:14:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62390 states, 57353 states have (on average 1.6497829232995658) internal successors, (94620), 59416 states have internal predecessors, (94620), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:14:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62390 states to 62390 states and 115404 transitions. [2025-02-05 17:14:08,305 INFO L78 Accepts]: Start accepts. Automaton has 62390 states and 115404 transitions. Word has length 146 [2025-02-05 17:14:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:14:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 62390 states and 115404 transitions. [2025-02-05 17:14:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:14:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62390 states and 115404 transitions. [2025-02-05 17:14:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:14:08,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:14:08,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:14:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:14:08,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:14:08,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:14:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1829134955, now seen corresponding path program 1 times [2025-02-05 17:14:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:14:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319329818] [2025-02-05 17:14:08,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:14:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:14:08,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:14:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:14:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:14:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:14:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:14:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:14:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319329818] [2025-02-05 17:14:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319329818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:14:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:14:08,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:14:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243409992] [2025-02-05 17:14:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:14:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:14:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:14:08,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:14:08,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:14:08,438 INFO L87 Difference]: Start difference. First operand 62390 states and 115404 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:14:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:14:13,826 INFO L93 Difference]: Finished difference Result 200698 states and 398403 transitions. [2025-02-05 17:14:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:14:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2025-02-05 17:14:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:14:14,386 INFO L225 Difference]: With dead ends: 200698 [2025-02-05 17:14:14,386 INFO L226 Difference]: Without dead ends: 140446 [2025-02-05 17:14:14,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:14:14,572 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 4944 mSDsluCounter, 13783 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4971 SdHoareTripleChecker+Valid, 18360 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:14:14,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4971 Valid, 18360 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:14:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140446 states.