./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:55:04,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:55:04,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:55:04,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:55:04,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:55:04,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:55:04,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:55:04,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:55:04,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:55:04,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:55:04,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:55:04,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:55:04,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:55:04,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:55:04,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:55:04,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:55:04,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:55:04,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:55:04,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:55:04,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:55:04,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:55:04,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:55:04,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 [2025-03-16 19:55:04,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:55:04,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:55:04,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:55:04,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:55:04,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:55:04,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2025-03-16 19:55:05,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720a14374/b11d642825dc495fa2017fa6d09d7988/FLAGaa7606c8d [2025-03-16 19:55:06,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:55:06,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2025-03-16 19:55:06,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720a14374/b11d642825dc495fa2017fa6d09d7988/FLAGaa7606c8d [2025-03-16 19:55:06,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720a14374/b11d642825dc495fa2017fa6d09d7988 [2025-03-16 19:55:06,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:55:06,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:55:06,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:55:06,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:55:06,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:55:06,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:55:06" (1/1) ... [2025-03-16 19:55:06,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad3d11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:06, skipping insertion in model container [2025-03-16 19:55:06,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:55:06" (1/1) ... [2025-03-16 19:55:06,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:55:07,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2025-03-16 19:55:07,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2025-03-16 19:55:07,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:55:07,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:55:08,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2025-03-16 19:55:08,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2025-03-16 19:55:08,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:55:08,283 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:55:08,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08 WrapperNode [2025-03-16 19:55:08,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:55:08,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:55:08,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:55:08,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:55:08,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,708 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-16 19:55:08,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:55:08,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:55:08,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:55:08,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:55:08,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:55:08,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:08,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:55:09,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:55:09,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:55:09,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:55:09,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (1/1) ... [2025-03-16 19:55:09,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:55:09,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:55:09,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:55:09,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:55:09,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:55:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:55:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:55:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:55:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:55:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:55:09,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:55:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:55:09,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:55:09,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:55:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:55:09,311 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:55:09,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:55:15,206 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:55:15,206 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:55:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:55:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:55:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:55:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:55:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:55:15,395 INFO L? ?]: Removed 1720 outVars from TransFormulas that were not future-live. [2025-03-16 19:55:15,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:55:15,457 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:55:15,457 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:55:15,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:55:15 BoogieIcfgContainer [2025-03-16 19:55:15,458 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:55:15,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:55:15,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:55:15,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:55:15,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:55:06" (1/3) ... [2025-03-16 19:55:15,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b14e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:55:15, skipping insertion in model container [2025-03-16 19:55:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:08" (2/3) ... [2025-03-16 19:55:15,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709b14e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:55:15, skipping insertion in model container [2025-03-16 19:55:15,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:55:15" (3/3) ... [2025-03-16 19:55:15,530 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.08.cil-1.c [2025-03-16 19:55:15,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:55:15,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.08.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 19:55:15,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:55:15,652 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;@636ef2ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:55:15,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:55:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:55:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:15,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:15,674 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] [2025-03-16 19:55:15,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:15,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1165894761, now seen corresponding path program 1 times [2025-03-16 19:55:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78804124] [2025-03-16 19:55:15,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:15,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:15,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:15,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:15,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78804124] [2025-03-16 19:55:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78804124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:55:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702942616] [2025-03-16 19:55:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:15,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:55:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:15,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:55:15,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:55:15,973 INFO L87 Difference]: Start difference. First operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:16,127 INFO L93 Difference]: Finished difference Result 4770 states and 8894 transitions. [2025-03-16 19:55:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:55:16,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:16,153 INFO L225 Difference]: With dead ends: 4770 [2025-03-16 19:55:16,153 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:55:16,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:55:16,162 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 412 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:16,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 8341 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:55:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:55:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-03-16 19:55:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2353 states have (on average 1.839779005524862) internal successors, (4329), 2355 states have internal predecessors, (4329), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:55:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 4373 transitions. [2025-03-16 19:55:16,282 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 4373 transitions. Word has length 121 [2025-03-16 19:55:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:16,283 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 4373 transitions. [2025-03-16 19:55:16,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 4373 transitions. [2025-03-16 19:55:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:16,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:16,293 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] [2025-03-16 19:55:16,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:55:16,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash -342213290, now seen corresponding path program 1 times [2025-03-16 19:55:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823918802] [2025-03-16 19:55:16,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:16,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:16,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:16,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823918802] [2025-03-16 19:55:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823918802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075776949] [2025-03-16 19:55:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:16,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:16,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:16,550 INFO L87 Difference]: Start difference. First operand 2383 states and 4373 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:17,028 INFO L93 Difference]: Finished difference Result 2912 states and 5222 transitions. [2025-03-16 19:55:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:55:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:17,039 INFO L225 Difference]: With dead ends: 2912 [2025-03-16 19:55:17,039 INFO L226 Difference]: Without dead ends: 2664 [2025-03-16 19:55:17,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:17,041 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4738 mSDsluCounter, 8740 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:17,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 13024 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-16 19:55:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2643. [2025-03-16 19:55:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8188489764387794) internal successors, (4709), 2592 states have internal predecessors, (4709), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:55:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4788 transitions. [2025-03-16 19:55:17,096 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4788 transitions. Word has length 121 [2025-03-16 19:55:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4788 transitions. [2025-03-16 19:55:17,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4788 transitions. [2025-03-16 19:55:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:17,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:17,098 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] [2025-03-16 19:55:17,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:55:17,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2077914614, now seen corresponding path program 1 times [2025-03-16 19:55:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:17,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504462440] [2025-03-16 19:55:17,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:17,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:17,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:17,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504462440] [2025-03-16 19:55:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504462440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702971100] [2025-03-16 19:55:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:17,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:17,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:17,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:17,245 INFO L87 Difference]: Start difference. First operand 2643 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:17,603 INFO L93 Difference]: Finished difference Result 3205 states and 5700 transitions. [2025-03-16 19:55:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:17,612 INFO L225 Difference]: With dead ends: 3205 [2025-03-16 19:55:17,613 INFO L226 Difference]: Without dead ends: 2697 [2025-03-16 19:55:17,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:17,614 INFO L435 NwaCegarLoop]: 4274 mSDtfsCounter, 4512 mSDsluCounter, 8433 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 12707 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:17,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 12707 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:55:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-16 19:55:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2643. [2025-03-16 19:55:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8180764774044031) internal successors, (4707), 2592 states have internal predecessors, (4707), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:55:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4786 transitions. [2025-03-16 19:55:17,668 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4786 transitions. Word has length 121 [2025-03-16 19:55:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:17,668 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4786 transitions. [2025-03-16 19:55:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4786 transitions. [2025-03-16 19:55:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:17,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:17,670 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] [2025-03-16 19:55:17,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:55:17,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:17,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1086266057, now seen corresponding path program 1 times [2025-03-16 19:55:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050683251] [2025-03-16 19:55:17,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:17,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:17,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:17,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:17,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050683251] [2025-03-16 19:55:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050683251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502647428] [2025-03-16 19:55:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:17,889 INFO L87 Difference]: Start difference. First operand 2643 states and 4786 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:18,469 INFO L93 Difference]: Finished difference Result 3480 states and 6133 transitions. [2025-03-16 19:55:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:18,481 INFO L225 Difference]: With dead ends: 3480 [2025-03-16 19:55:18,482 INFO L226 Difference]: Without dead ends: 2972 [2025-03-16 19:55:18,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:18,486 INFO L435 NwaCegarLoop]: 4502 mSDtfsCounter, 4732 mSDsluCounter, 13523 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4748 SdHoareTripleChecker+Valid, 18025 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:18,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4748 Valid, 18025 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2025-03-16 19:55:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2883. [2025-03-16 19:55:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2805 states have (on average 1.7989304812834224) internal successors, (5046), 2809 states have internal predecessors, (5046), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 19:55:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 5162 transitions. [2025-03-16 19:55:18,566 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 5162 transitions. Word has length 121 [2025-03-16 19:55:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 2883 states and 5162 transitions. [2025-03-16 19:55:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 5162 transitions. [2025-03-16 19:55:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:18,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:18,570 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] [2025-03-16 19:55:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:55:18,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2019620394, now seen corresponding path program 1 times [2025-03-16 19:55:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323067640] [2025-03-16 19:55:18,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:18,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:18,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:18,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323067640] [2025-03-16 19:55:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323067640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739781764] [2025-03-16 19:55:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:18,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:18,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:18,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:18,740 INFO L87 Difference]: Start difference. First operand 2883 states and 5162 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:19,254 INFO L93 Difference]: Finished difference Result 4243 states and 7346 transitions. [2025-03-16 19:55:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:19,268 INFO L225 Difference]: With dead ends: 4243 [2025-03-16 19:55:19,268 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 19:55:19,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:19,272 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4751 mSDsluCounter, 13061 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4767 SdHoareTripleChecker+Valid, 17368 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:19,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4767 Valid, 17368 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 19:55:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3394. [2025-03-16 19:55:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3266 states have (on average 1.769442743417024) internal successors, (5779), 3274 states have internal predecessors, (5779), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 19:55:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 5975 transitions. [2025-03-16 19:55:19,369 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 5975 transitions. Word has length 121 [2025-03-16 19:55:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 5975 transitions. [2025-03-16 19:55:19,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 5975 transitions. [2025-03-16 19:55:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:19,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:19,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:55:19,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:55:19,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash -525707945, now seen corresponding path program 1 times [2025-03-16 19:55:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529536443] [2025-03-16 19:55:19,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:19,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529536443] [2025-03-16 19:55:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529536443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:19,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:19,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275249126] [2025-03-16 19:55:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:19,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:19,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:19,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:19,476 INFO L87 Difference]: Start difference. First operand 3394 states and 5975 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:20,046 INFO L93 Difference]: Finished difference Result 5888 states and 10013 transitions. [2025-03-16 19:55:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:20,063 INFO L225 Difference]: With dead ends: 5888 [2025-03-16 19:55:20,063 INFO L226 Difference]: Without dead ends: 4629 [2025-03-16 19:55:20,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:20,068 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4722 mSDsluCounter, 13502 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:20,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 17997 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-16 19:55:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4503. [2025-03-16 19:55:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4269 states have (on average 1.7331927851955962) internal successors, (7399), 4291 states have internal predecessors, (7399), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 19:55:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 7779 transitions. [2025-03-16 19:55:20,176 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 7779 transitions. Word has length 121 [2025-03-16 19:55:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:20,176 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 7779 transitions. [2025-03-16 19:55:20,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 7779 transitions. [2025-03-16 19:55:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:20,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:20,178 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] [2025-03-16 19:55:20,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:55:20,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:20,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1724443210, now seen corresponding path program 1 times [2025-03-16 19:55:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850348786] [2025-03-16 19:55:20,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:20,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850348786] [2025-03-16 19:55:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850348786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077328175] [2025-03-16 19:55:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:20,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:20,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:20,286 INFO L87 Difference]: Start difference. First operand 4503 states and 7779 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:20,883 INFO L93 Difference]: Finished difference Result 9507 states and 16047 transitions. [2025-03-16 19:55:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:20,917 INFO L225 Difference]: With dead ends: 9507 [2025-03-16 19:55:20,918 INFO L226 Difference]: Without dead ends: 7139 [2025-03-16 19:55:20,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:20,927 INFO L435 NwaCegarLoop]: 4492 mSDtfsCounter, 4717 mSDsluCounter, 13493 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 17985 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:20,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 17985 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2025-03-16 19:55:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 6964. [2025-03-16 19:55:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6964 states, 6500 states have (on average 1.7026153846153846) internal successors, (11067), 6568 states have internal predecessors, (11067), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 19:55:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6964 states to 6964 states and 11911 transitions. [2025-03-16 19:55:21,172 INFO L78 Accepts]: Start accepts. Automaton has 6964 states and 11911 transitions. Word has length 121 [2025-03-16 19:55:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:21,173 INFO L471 AbstractCegarLoop]: Abstraction has 6964 states and 11911 transitions. [2025-03-16 19:55:21,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6964 states and 11911 transitions. [2025-03-16 19:55:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:21,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:21,176 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] [2025-03-16 19:55:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:55:21,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:21,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1208922761, now seen corresponding path program 1 times [2025-03-16 19:55:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980751557] [2025-03-16 19:55:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:21,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:21,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980751557] [2025-03-16 19:55:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980751557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:21,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:21,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666001609] [2025-03-16 19:55:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:21,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:21,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:21,270 INFO L87 Difference]: Start difference. First operand 6964 states and 11911 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:21,883 INFO L93 Difference]: Finished difference Result 17658 states and 30193 transitions. [2025-03-16 19:55:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:21,922 INFO L225 Difference]: With dead ends: 17658 [2025-03-16 19:55:21,922 INFO L226 Difference]: Without dead ends: 12829 [2025-03-16 19:55:21,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:21,939 INFO L435 NwaCegarLoop]: 4489 mSDtfsCounter, 4712 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4728 SdHoareTripleChecker+Valid, 17973 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:21,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4728 Valid, 17973 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-03-16 19:55:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12561. [2025-03-16 19:55:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.690667357334024) internal successors, (19583), 11797 states have internal predecessors, (19583), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:55:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21739 transitions. [2025-03-16 19:55:22,468 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21739 transitions. Word has length 121 [2025-03-16 19:55:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:22,469 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21739 transitions. [2025-03-16 19:55:22,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21739 transitions. [2025-03-16 19:55:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:22,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:22,475 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] [2025-03-16 19:55:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:55:22,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2132842902, now seen corresponding path program 1 times [2025-03-16 19:55:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987724776] [2025-03-16 19:55:22,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:22,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:22,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:22,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:22,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:22,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987724776] [2025-03-16 19:55:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987724776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:22,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:22,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981439566] [2025-03-16 19:55:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:22,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:22,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:22,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:22,628 INFO L87 Difference]: Start difference. First operand 12561 states and 21739 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:23,121 INFO L93 Difference]: Finished difference Result 25927 states and 45733 transitions. [2025-03-16 19:55:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:23,170 INFO L225 Difference]: With dead ends: 25927 [2025-03-16 19:55:23,170 INFO L226 Difference]: Without dead ends: 15501 [2025-03-16 19:55:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:23,200 INFO L435 NwaCegarLoop]: 4261 mSDtfsCounter, 4504 mSDsluCounter, 8408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12669 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:23,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12669 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15501 states. [2025-03-16 19:55:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15501 to 12561. [2025-03-16 19:55:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6878183544850212) internal successors, (19550), 11797 states have internal predecessors, (19550), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:55:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21706 transitions. [2025-03-16 19:55:23,796 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21706 transitions. Word has length 121 [2025-03-16 19:55:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:23,796 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21706 transitions. [2025-03-16 19:55:23,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21706 transitions. [2025-03-16 19:55:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:23,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:23,803 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] [2025-03-16 19:55:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:55:23,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1361588841, now seen corresponding path program 1 times [2025-03-16 19:55:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728671725] [2025-03-16 19:55:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:23,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:23,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728671725] [2025-03-16 19:55:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728671725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748229774] [2025-03-16 19:55:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:23,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:23,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:23,905 INFO L87 Difference]: Start difference. First operand 12561 states and 21706 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:24,488 INFO L93 Difference]: Finished difference Result 25682 states and 45177 transitions. [2025-03-16 19:55:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:24,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:24,537 INFO L225 Difference]: With dead ends: 25682 [2025-03-16 19:55:24,537 INFO L226 Difference]: Without dead ends: 15256 [2025-03-16 19:55:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:24,564 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4501 mSDsluCounter, 8403 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12661 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:24,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12661 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15256 states. [2025-03-16 19:55:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15256 to 12561. [2025-03-16 19:55:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6849693516360182) internal successors, (19517), 11797 states have internal predecessors, (19517), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:55:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21673 transitions. [2025-03-16 19:55:25,023 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21673 transitions. Word has length 121 [2025-03-16 19:55:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:25,024 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21673 transitions. [2025-03-16 19:55:25,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21673 transitions. [2025-03-16 19:55:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:25,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:25,030 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] [2025-03-16 19:55:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:55:25,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:25,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1889954442, now seen corresponding path program 1 times [2025-03-16 19:55:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061310055] [2025-03-16 19:55:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:25,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061310055] [2025-03-16 19:55:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061310055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893690544] [2025-03-16 19:55:25,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:25,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:25,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:25,130 INFO L87 Difference]: Start difference. First operand 12561 states and 21673 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:26,093 INFO L93 Difference]: Finished difference Result 37593 states and 66162 transitions. [2025-03-16 19:55:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:26,185 INFO L225 Difference]: With dead ends: 37593 [2025-03-16 19:55:26,185 INFO L226 Difference]: Without dead ends: 27167 [2025-03-16 19:55:26,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:26,216 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4918 mSDsluCounter, 13436 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4943 SdHoareTripleChecker+Valid, 17910 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:26,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4943 Valid, 17910 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27167 states. [2025-03-16 19:55:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27167 to 25036. [2025-03-16 19:55:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.6887772925764193) internal successors, (38673), 23568 states have internal predecessors, (38673), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:55:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44925 transitions. [2025-03-16 19:55:27,005 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44925 transitions. Word has length 121 [2025-03-16 19:55:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:27,006 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44925 transitions. [2025-03-16 19:55:27,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44925 transitions. [2025-03-16 19:55:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:27,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:27,016 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] [2025-03-16 19:55:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:55:27,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1214261833, now seen corresponding path program 1 times [2025-03-16 19:55:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779154605] [2025-03-16 19:55:27,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:27,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:27,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:27,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:27,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:27,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779154605] [2025-03-16 19:55:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779154605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:27,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529941835] [2025-03-16 19:55:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:27,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:27,103 INFO L87 Difference]: Start difference. First operand 25036 states and 44925 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:28,567 INFO L93 Difference]: Finished difference Result 54516 states and 101061 transitions. [2025-03-16 19:55:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:28,701 INFO L225 Difference]: With dead ends: 54516 [2025-03-16 19:55:28,701 INFO L226 Difference]: Without dead ends: 31615 [2025-03-16 19:55:28,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:28,932 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4495 mSDsluCounter, 8392 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 12645 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:28,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 12645 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31615 states. [2025-03-16 19:55:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31615 to 25036. [2025-03-16 19:55:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.685938864628821) internal successors, (38608), 23568 states have internal predecessors, (38608), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:55:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44860 transitions. [2025-03-16 19:55:29,939 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44860 transitions. Word has length 121 [2025-03-16 19:55:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:29,939 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44860 transitions. [2025-03-16 19:55:29,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44860 transitions. [2025-03-16 19:55:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:29,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:29,948 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] [2025-03-16 19:55:29,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:55:29,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2023749290, now seen corresponding path program 1 times [2025-03-16 19:55:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810772935] [2025-03-16 19:55:29,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:29,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:29,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:29,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810772935] [2025-03-16 19:55:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810772935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729910976] [2025-03-16 19:55:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:30,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:30,035 INFO L87 Difference]: Start difference. First operand 25036 states and 44860 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:32,071 INFO L93 Difference]: Finished difference Result 79502 states and 149057 transitions. [2025-03-16 19:55:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:55:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:32,405 INFO L225 Difference]: With dead ends: 79502 [2025-03-16 19:55:32,405 INFO L226 Difference]: Without dead ends: 56601 [2025-03-16 19:55:32,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:55:32,489 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4886 mSDsluCounter, 12995 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:32,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 17284 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:55:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56601 states. [2025-03-16 19:55:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56601 to 53292. [2025-03-16 19:55:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.6968957963047162) internal successors, (82106), 50448 states have internal predecessors, (82106), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:55:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102630 transitions. [2025-03-16 19:55:35,595 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102630 transitions. Word has length 121 [2025-03-16 19:55:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:35,596 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102630 transitions. [2025-03-16 19:55:35,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102630 transitions. [2025-03-16 19:55:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:35,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:35,612 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] [2025-03-16 19:55:35,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:55:35,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:35,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1829463511, now seen corresponding path program 1 times [2025-03-16 19:55:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801463344] [2025-03-16 19:55:35,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:35,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:35,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:35,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:35,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801463344] [2025-03-16 19:55:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801463344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495145616] [2025-03-16 19:55:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:35,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:35,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:35,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:35,687 INFO L87 Difference]: Start difference. First operand 53292 states and 102630 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:38,645 INFO L93 Difference]: Finished difference Result 119772 states and 242001 transitions. [2025-03-16 19:55:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:38,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:38,993 INFO L225 Difference]: With dead ends: 119772 [2025-03-16 19:55:38,993 INFO L226 Difference]: Without dead ends: 68615 [2025-03-16 19:55:39,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:39,154 INFO L435 NwaCegarLoop]: 4248 mSDtfsCounter, 4491 mSDsluCounter, 8383 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:39,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 12631 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2025-03-16 19:55:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 53292. [2025-03-16 19:55:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.694229735874013) internal successors, (81977), 50448 states have internal predecessors, (81977), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:55:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102501 transitions. [2025-03-16 19:55:42,451 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102501 transitions. Word has length 121 [2025-03-16 19:55:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:42,452 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102501 transitions. [2025-03-16 19:55:42,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102501 transitions. [2025-03-16 19:55:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:42,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:42,467 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] [2025-03-16 19:55:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:55:42,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1815213366, now seen corresponding path program 1 times [2025-03-16 19:55:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930740368] [2025-03-16 19:55:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:42,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:42,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:42,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:42,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930740368] [2025-03-16 19:55:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930740368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:55:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040034765] [2025-03-16 19:55:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:55:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:42,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:55:42,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:55:42,527 INFO L87 Difference]: Start difference. First operand 53292 states and 102501 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:55:45,107 INFO L93 Difference]: Finished difference Result 117583 states and 237365 transitions. [2025-03-16 19:55:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:55:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:55:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:55:45,395 INFO L225 Difference]: With dead ends: 117583 [2025-03-16 19:55:45,395 INFO L226 Difference]: Without dead ends: 66426 [2025-03-16 19:55:45,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:45,547 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4488 mSDsluCounter, 8378 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 12623 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:55:45,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 12623 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:55:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66426 states. [2025-03-16 19:55:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66426 to 53292. [2025-03-16 19:55:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.69156367544331) internal successors, (81848), 50448 states have internal predecessors, (81848), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:55:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102372 transitions. [2025-03-16 19:55:48,587 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102372 transitions. Word has length 121 [2025-03-16 19:55:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:55:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102372 transitions. [2025-03-16 19:55:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:55:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102372 transitions. [2025-03-16 19:55:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:55:48,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:55:48,603 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] [2025-03-16 19:55:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:55:48,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:55:48,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:55:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash 844922359, now seen corresponding path program 1 times [2025-03-16 19:55:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:55:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68375889] [2025-03-16 19:55:48,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:55:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:55:48,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:55:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:55:48,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:55:48,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:55:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:55:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:55:48,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68375889] [2025-03-16 19:55:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68375889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:55:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:55:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:55:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127821387] [2025-03-16 19:55:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:55:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:55:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:55:48,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:55:48,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:55:48,680 INFO L87 Difference]: Start difference. First operand 53292 states and 102372 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)