./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:00:36,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:00:36,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:00:36,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:00:36,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:00:36,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:00:36,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:00:36,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:00:36,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:00:36,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:00:36,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:00:36,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:00:36,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:00:36,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:00:36,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:00:36,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:00:36,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:00:36,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:00:36,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:00:36,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:00:36,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:00:36,575 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 -> 306f27715421bb9e01ba3845cf0d248e2328487b897edb7780679dfca2048140 [2025-03-16 20:00:36,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:00:36,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:00:36,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:00:36,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:00:36,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:00:36,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2025-03-16 20:00:37,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c62a1f7/98b368ecd62e4230af5aa8aabd190560/FLAG2a17890f0 [2025-03-16 20:00:38,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:00:38,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.06.cil-2.c [2025-03-16 20:00:38,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c62a1f7/98b368ecd62e4230af5aa8aabd190560/FLAG2a17890f0 [2025-03-16 20:00:38,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c62a1f7/98b368ecd62e4230af5aa8aabd190560 [2025-03-16 20:00:38,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:00:38,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:00:38,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:00:38,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:00:38,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:00:38,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:00:38" (1/1) ... [2025-03-16 20:00:38,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:38, skipping insertion in model container [2025-03-16 20:00:38,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:00:38" (1/1) ... [2025-03-16 20:00:38,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:00:39,670 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_label44+token_ring.06.cil-2.c[377340,377353] [2025-03-16 20:00:39,698 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_label44+token_ring.06.cil-2.c[383339,383352] [2025-03-16 20:00:39,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:00:39,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:00:40,332 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_label44+token_ring.06.cil-2.c[377340,377353] [2025-03-16 20:00:40,338 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_label44+token_ring.06.cil-2.c[383339,383352] [2025-03-16 20:00:40,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:00:40,397 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:00:40,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40 WrapperNode [2025-03-16 20:00:40,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:00:40,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:00:40,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:00:40,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:00:40,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,793 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-03-16 20:00:40,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:00:40,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:00:40,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:00:40,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:00:40,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:00:40,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:40,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:00:41,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:00:41,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:00:41,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:00:41,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (1/1) ... [2025-03-16 20:00:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:00:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:00:41,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:00:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:00:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:00:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:00:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:00:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:00:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:00:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:00:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:00:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:00:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:00:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:00:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:00:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:00:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:00:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:00:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:00:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:00:41,263 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:00:41,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:00:47,126 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:00:47,126 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:00:47,127 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:00:47,127 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:00:47,127 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:00:47,127 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:00:47,127 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:00:47,294 INFO L? ?]: Removed 1710 outVars from TransFormulas that were not future-live. [2025-03-16 20:00:47,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:00:47,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:00:47,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:00:47,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:00:47 BoogieIcfgContainer [2025-03-16 20:00:47,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:00:47,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:00:47,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:00:47,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:00:47,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:00:38" (1/3) ... [2025-03-16 20:00:47,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1080e0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:00:47, skipping insertion in model container [2025-03-16 20:00:47,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:00:40" (2/3) ... [2025-03-16 20:00:47,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1080e0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:00:47, skipping insertion in model container [2025-03-16 20:00:47,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:00:47" (3/3) ... [2025-03-16 20:00:47,350 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.06.cil-2.c [2025-03-16 20:00:47,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:00:47,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.06.cil-2.c that has 7 procedures, 2340 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-16 20:00:47,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:00:47,456 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;@1771d9c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:00:47,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:00:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 2340 states, 2312 states have (on average 1.8737024221453287) internal successors, (4332), 2314 states have internal predecessors, (4332), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 20:00:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:47,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:47,473 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] [2025-03-16 20:00:47,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1793465467, now seen corresponding path program 1 times [2025-03-16 20:00:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5029568] [2025-03-16 20:00:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:47,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:47,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:47,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:47,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5029568] [2025-03-16 20:00:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5029568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:00:47,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200646060] [2025-03-16 20:00:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:47,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:00:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:47,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:00:47,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:00:47,904 INFO L87 Difference]: Start difference. First operand has 2340 states, 2312 states have (on average 1.8737024221453287) internal successors, (4332), 2314 states have internal predecessors, (4332), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:48,610 INFO L93 Difference]: Finished difference Result 4898 states and 9101 transitions. [2025-03-16 20:00:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:00:48,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:48,644 INFO L225 Difference]: With dead ends: 4898 [2025-03-16 20:00:48,644 INFO L226 Difference]: Without dead ends: 2562 [2025-03-16 20:00:48,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:48,658 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4581 mSDsluCounter, 8594 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4595 SdHoareTripleChecker+Valid, 12823 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:48,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4595 Valid, 12823 Invalid, 409 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:00:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-16 20:00:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2545. [2025-03-16 20:00:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2495 states have (on average 1.825250501002004) internal successors, (4554), 2498 states have internal predecessors, (4554), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 20:00:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4625 transitions. [2025-03-16 20:00:48,803 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4625 transitions. Word has length 101 [2025-03-16 20:00:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:48,804 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4625 transitions. [2025-03-16 20:00:48,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4625 transitions. [2025-03-16 20:00:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:48,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:48,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:00:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:00:48,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -982505637, now seen corresponding path program 1 times [2025-03-16 20:00:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137979060] [2025-03-16 20:00:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:48,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:48,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:48,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137979060] [2025-03-16 20:00:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137979060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:00:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033925708] [2025-03-16 20:00:49,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:49,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:00:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:49,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:00:49,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:00:49,025 INFO L87 Difference]: Start difference. First operand 2545 states and 4625 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:49,293 INFO L93 Difference]: Finished difference Result 2999 states and 5353 transitions. [2025-03-16 20:00:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:00:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:49,307 INFO L225 Difference]: With dead ends: 2999 [2025-03-16 20:00:49,307 INFO L226 Difference]: Without dead ends: 2587 [2025-03-16 20:00:49,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:49,310 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4399 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 12538 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:49,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 12538 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:00:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-03-16 20:00:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2545. [2025-03-16 20:00:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2495 states have (on average 1.8244488977955913) internal successors, (4552), 2498 states have internal predecessors, (4552), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 20:00:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4623 transitions. [2025-03-16 20:00:49,382 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4623 transitions. Word has length 101 [2025-03-16 20:00:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:49,382 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4623 transitions. [2025-03-16 20:00:49,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4623 transitions. [2025-03-16 20:00:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:49,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:49,384 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] [2025-03-16 20:00:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:00:49,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:49,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2103219420, now seen corresponding path program 1 times [2025-03-16 20:00:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334524690] [2025-03-16 20:00:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:49,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:49,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334524690] [2025-03-16 20:00:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334524690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140534625] [2025-03-16 20:00:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:49,551 INFO L87 Difference]: Start difference. First operand 2545 states and 4623 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:50,023 INFO L93 Difference]: Finished difference Result 3220 states and 5694 transitions. [2025-03-16 20:00:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:50,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:50,037 INFO L225 Difference]: With dead ends: 3220 [2025-03-16 20:00:50,037 INFO L226 Difference]: Without dead ends: 2808 [2025-03-16 20:00:50,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:50,040 INFO L435 NwaCegarLoop]: 4393 mSDtfsCounter, 4565 mSDsluCounter, 13178 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 17571 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:50,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 17571 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2025-03-16 20:00:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2739. [2025-03-16 20:00:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2667 states have (on average 1.806899137607799) internal successors, (4819), 2671 states have internal predecessors, (4819), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-16 20:00:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4923 transitions. [2025-03-16 20:00:50,167 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4923 transitions. Word has length 101 [2025-03-16 20:00:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 2739 states and 4923 transitions. [2025-03-16 20:00:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4923 transitions. [2025-03-16 20:00:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:50,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:50,168 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] [2025-03-16 20:00:50,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:00:50,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -983829701, now seen corresponding path program 1 times [2025-03-16 20:00:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651635278] [2025-03-16 20:00:50,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:50,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:50,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:50,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651635278] [2025-03-16 20:00:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651635278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455403637] [2025-03-16 20:00:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:50,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:50,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:50,283 INFO L87 Difference]: Start difference. First operand 2739 states and 4923 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:50,753 INFO L93 Difference]: Finished difference Result 3833 states and 6655 transitions. [2025-03-16 20:00:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:50,765 INFO L225 Difference]: With dead ends: 3833 [2025-03-16 20:00:50,766 INFO L226 Difference]: Without dead ends: 3227 [2025-03-16 20:00:50,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:50,769 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4560 mSDsluCounter, 13166 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 17555 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:50,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 17555 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2025-03-16 20:00:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3150. [2025-03-16 20:00:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3032 states have (on average 1.7783641160949868) internal successors, (5392), 3040 states have internal predecessors, (5392), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-16 20:00:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 5568 transitions. [2025-03-16 20:00:50,846 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 5568 transitions. Word has length 101 [2025-03-16 20:00:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 5568 transitions. [2025-03-16 20:00:50,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 5568 transitions. [2025-03-16 20:00:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:50,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:50,848 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] [2025-03-16 20:00:50,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:00:50,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1826082044, now seen corresponding path program 1 times [2025-03-16 20:00:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:50,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646800942] [2025-03-16 20:00:50,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:50,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:50,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:50,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:50,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:50,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646800942] [2025-03-16 20:00:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646800942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511500202] [2025-03-16 20:00:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:50,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:50,969 INFO L87 Difference]: Start difference. First operand 3150 states and 5568 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:51,549 INFO L93 Difference]: Finished difference Result 5146 states and 8754 transitions. [2025-03-16 20:00:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:51,565 INFO L225 Difference]: With dead ends: 5146 [2025-03-16 20:00:51,566 INFO L226 Difference]: Without dead ends: 4129 [2025-03-16 20:00:51,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:51,570 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4555 mSDsluCounter, 13157 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 17543 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:51,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 17543 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2025-03-16 20:00:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 4035. [2025-03-16 20:00:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 3819 states have (on average 1.7397224404294318) internal successors, (6644), 3841 states have internal predecessors, (6644), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-16 20:00:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6988 transitions. [2025-03-16 20:00:51,703 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6988 transitions. Word has length 101 [2025-03-16 20:00:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 6988 transitions. [2025-03-16 20:00:51,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6988 transitions. [2025-03-16 20:00:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:51,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:51,705 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] [2025-03-16 20:00:51,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:00:51,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1685506277, now seen corresponding path program 1 times [2025-03-16 20:00:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124174053] [2025-03-16 20:00:51,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:51,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:51,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:51,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:51,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124174053] [2025-03-16 20:00:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124174053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:51,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96619242] [2025-03-16 20:00:51,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:51,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:51,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:51,827 INFO L87 Difference]: Start difference. First operand 4035 states and 6988 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:52,366 INFO L93 Difference]: Finished difference Result 8005 states and 13460 transitions. [2025-03-16 20:00:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:52,389 INFO L225 Difference]: With dead ends: 8005 [2025-03-16 20:00:52,390 INFO L226 Difference]: Without dead ends: 6103 [2025-03-16 20:00:52,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:52,399 INFO L435 NwaCegarLoop]: 4383 mSDtfsCounter, 4550 mSDsluCounter, 13148 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4564 SdHoareTripleChecker+Valid, 17531 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:52,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4564 Valid, 17531 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2025-03-16 20:00:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 5976. [2025-03-16 20:00:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5546 states have (on average 1.700685178507032) internal successors, (9432), 5614 states have internal predecessors, (9432), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-16 20:00:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 10208 transitions. [2025-03-16 20:00:52,576 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 10208 transitions. Word has length 101 [2025-03-16 20:00:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:52,576 INFO L471 AbstractCegarLoop]: Abstraction has 5976 states and 10208 transitions. [2025-03-16 20:00:52,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 10208 transitions. [2025-03-16 20:00:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:52,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:52,580 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] [2025-03-16 20:00:52,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:00:52,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2080541980, now seen corresponding path program 1 times [2025-03-16 20:00:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452663132] [2025-03-16 20:00:52,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:52,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:52,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:52,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452663132] [2025-03-16 20:00:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452663132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980289763] [2025-03-16 20:00:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:52,707 INFO L87 Difference]: Start difference. First operand 5976 states and 10208 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:53,256 INFO L93 Difference]: Finished difference Result 14348 states and 24374 transitions. [2025-03-16 20:00:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:53,299 INFO L225 Difference]: With dead ends: 14348 [2025-03-16 20:00:53,299 INFO L226 Difference]: Without dead ends: 10505 [2025-03-16 20:00:53,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:53,316 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4571 mSDsluCounter, 12792 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 17022 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:53,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 17022 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:00:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2025-03-16 20:00:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10317. [2025-03-16 20:00:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10317 states, 9405 states have (on average 1.6752791068580541) internal successors, (15756), 9619 states have internal predecessors, (15756), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-16 20:00:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10317 states to 10317 states and 17780 transitions. [2025-03-16 20:00:53,703 INFO L78 Accepts]: Start accepts. Automaton has 10317 states and 17780 transitions. Word has length 101 [2025-03-16 20:00:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:53,704 INFO L471 AbstractCegarLoop]: Abstraction has 10317 states and 17780 transitions. [2025-03-16 20:00:53,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10317 states and 17780 transitions. [2025-03-16 20:00:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:53,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:53,712 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] [2025-03-16 20:00:53,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:00:53,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:53,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1509290747, now seen corresponding path program 1 times [2025-03-16 20:00:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735774850] [2025-03-16 20:00:53,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:53,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735774850] [2025-03-16 20:00:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735774850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676330913] [2025-03-16 20:00:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:53,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:53,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:53,811 INFO L87 Difference]: Start difference. First operand 10317 states and 17780 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:54,694 INFO L93 Difference]: Finished difference Result 29975 states and 52821 transitions. [2025-03-16 20:00:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:00:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:54,874 INFO L225 Difference]: With dead ends: 29975 [2025-03-16 20:00:54,875 INFO L226 Difference]: Without dead ends: 21791 [2025-03-16 20:00:54,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:00:54,922 INFO L435 NwaCegarLoop]: 4375 mSDtfsCounter, 4713 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 17494 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:54,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 17494 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:00:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21791 states. [2025-03-16 20:00:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21791 to 20118. [2025-03-16 20:00:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 18112 states have (on average 1.6711572438162545) internal successors, (30268), 18780 states have internal predecessors, (30268), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 20:00:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 36260 transitions. [2025-03-16 20:00:55,823 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 36260 transitions. Word has length 101 [2025-03-16 20:00:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:55,823 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 36260 transitions. [2025-03-16 20:00:55,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 36260 transitions. [2025-03-16 20:00:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:55,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:55,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:00:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:00:55,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:55,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1629410620, now seen corresponding path program 1 times [2025-03-16 20:00:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865294873] [2025-03-16 20:00:55,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:55,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:55,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:55,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:55,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865294873] [2025-03-16 20:00:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865294873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:55,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:00:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437766708] [2025-03-16 20:00:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:55,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:00:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:55,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:00:55,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:00:55,911 INFO L87 Difference]: Start difference. First operand 20118 states and 36260 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:00:56,980 INFO L93 Difference]: Finished difference Result 43220 states and 80810 transitions. [2025-03-16 20:00:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:00:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:00:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:00:57,106 INFO L225 Difference]: With dead ends: 43220 [2025-03-16 20:00:57,109 INFO L226 Difference]: Without dead ends: 25235 [2025-03-16 20:00:57,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:57,165 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4388 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 12492 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:00:57,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 12492 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:00:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25235 states. [2025-03-16 20:00:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25235 to 20118. [2025-03-16 20:00:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 18112 states have (on average 1.6675684628975265) internal successors, (30203), 18780 states have internal predecessors, (30203), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 20:00:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 36195 transitions. [2025-03-16 20:00:58,586 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 36195 transitions. Word has length 101 [2025-03-16 20:00:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:00:58,586 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 36195 transitions. [2025-03-16 20:00:58,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:00:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 36195 transitions. [2025-03-16 20:00:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:00:58,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:00:58,610 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] [2025-03-16 20:00:58,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:00:58,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:00:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:00:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2048927451, now seen corresponding path program 1 times [2025-03-16 20:00:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:00:58,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104828324] [2025-03-16 20:00:58,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:00:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:00:58,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:00:58,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:00:58,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:00:58,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:00:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:00:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:00:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104828324] [2025-03-16 20:00:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104828324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:00:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:00:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:00:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763627383] [2025-03-16 20:00:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:00:58,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:00:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:00:58,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:00:58,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:00:58,754 INFO L87 Difference]: Start difference. First operand 20118 states and 36195 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:00,380 INFO L93 Difference]: Finished difference Result 62442 states and 118688 transitions. [2025-03-16 20:01:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:00,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:01:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:00,769 INFO L225 Difference]: With dead ends: 62442 [2025-03-16 20:01:00,770 INFO L226 Difference]: Without dead ends: 44457 [2025-03-16 20:01:00,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:01:00,814 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4565 mSDsluCounter, 13096 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 17463 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:00,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 17463 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:01:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44457 states. [2025-03-16 20:01:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44457 to 42054. [2025-03-16 20:01:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.6700261990055072) internal successors, (62469), 39468 states have internal predecessors, (62469), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 20:01:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82477 transitions. [2025-03-16 20:01:03,374 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82477 transitions. Word has length 101 [2025-03-16 20:01:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:03,375 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82477 transitions. [2025-03-16 20:01:03,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82477 transitions. [2025-03-16 20:01:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:01:03,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:03,393 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] [2025-03-16 20:01:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:01:03,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2062460252, now seen corresponding path program 1 times [2025-03-16 20:01:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905150459] [2025-03-16 20:01:03,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:03,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:03,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:01:03,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:01:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:03,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905150459] [2025-03-16 20:01:03,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905150459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:03,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439661775] [2025-03-16 20:01:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:03,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:03,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:03,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:03,478 INFO L87 Difference]: Start difference. First operand 42054 states and 82477 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:05,498 INFO L93 Difference]: Finished difference Result 92920 states and 192942 transitions. [2025-03-16 20:01:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:01:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:05,801 INFO L225 Difference]: With dead ends: 92920 [2025-03-16 20:01:05,802 INFO L226 Difference]: Without dead ends: 52999 [2025-03-16 20:01:06,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:06,065 INFO L435 NwaCegarLoop]: 4191 mSDtfsCounter, 4384 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 12478 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:06,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 12478 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52999 states. [2025-03-16 20:01:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52999 to 42054. [2025-03-16 20:01:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.666577554403037) internal successors, (62340), 39468 states have internal predecessors, (62340), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 20:01:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82348 transitions. [2025-03-16 20:01:08,811 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82348 transitions. Word has length 101 [2025-03-16 20:01:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:08,812 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82348 transitions. [2025-03-16 20:01:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82348 transitions. [2025-03-16 20:01:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:01:08,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:08,827 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] [2025-03-16 20:01:08,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:01:08,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:08,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1123691845, now seen corresponding path program 1 times [2025-03-16 20:01:08,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:08,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441164695] [2025-03-16 20:01:08,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:01:08,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:01:08,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:08,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:08,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 20:01:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441164695] [2025-03-16 20:01:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441164695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226276619] [2025-03-16 20:01:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:08,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:08,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:08,906 INFO L87 Difference]: Start difference. First operand 42054 states and 82348 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:10,855 INFO L93 Difference]: Finished difference Result 90731 states and 188306 transitions. [2025-03-16 20:01:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:10,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:01:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:11,244 INFO L225 Difference]: With dead ends: 90731 [2025-03-16 20:01:11,244 INFO L226 Difference]: Without dead ends: 50810 [2025-03-16 20:01:11,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:11,345 INFO L435 NwaCegarLoop]: 4188 mSDtfsCounter, 4381 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4395 SdHoareTripleChecker+Valid, 12470 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:11,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4395 Valid, 12470 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:01:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50810 states. [2025-03-16 20:01:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50810 to 42054. [2025-03-16 20:01:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.6631289098005668) internal successors, (62211), 39468 states have internal predecessors, (62211), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 20:01:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82219 transitions. [2025-03-16 20:01:15,288 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82219 transitions. Word has length 101 [2025-03-16 20:01:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:15,288 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82219 transitions. [2025-03-16 20:01:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82219 transitions. [2025-03-16 20:01:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:01:15,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:15,305 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] [2025-03-16 20:01:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:01:15,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -256639620, now seen corresponding path program 1 times [2025-03-16 20:01:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000683695] [2025-03-16 20:01:15,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:15,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:01:15,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:01:15,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:15,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000683695] [2025-03-16 20:01:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000683695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29183773] [2025-03-16 20:01:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:15,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:15,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:15,406 INFO L87 Difference]: Start difference. First operand 42054 states and 82219 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:19,160 INFO L93 Difference]: Finished difference Result 129916 states and 280646 transitions. [2025-03-16 20:01:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:19,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:01:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:19,668 INFO L225 Difference]: With dead ends: 129916 [2025-03-16 20:01:19,668 INFO L226 Difference]: Without dead ends: 89995 [2025-03-16 20:01:19,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:01:19,811 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4544 mSDsluCounter, 13059 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 17413 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:19,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 17413 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:01:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89995 states. [2025-03-16 20:01:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89995 to 87921. [2025-03-16 20:01:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87921 states, 76595 states have (on average 1.6488674195443567) internal successors, (126295), 82903 states have internal predecessors, (126295), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-03-16 20:01:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87921 states to 87921 states and 198783 transitions. [2025-03-16 20:01:26,467 INFO L78 Accepts]: Start accepts. Automaton has 87921 states and 198783 transitions. Word has length 101 [2025-03-16 20:01:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:26,468 INFO L471 AbstractCegarLoop]: Abstraction has 87921 states and 198783 transitions. [2025-03-16 20:01:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 87921 states and 198783 transitions. [2025-03-16 20:01:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 20:01:26,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:26,495 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] [2025-03-16 20:01:26,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:01:26,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 186971803, now seen corresponding path program 1 times [2025-03-16 20:01:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371090139] [2025-03-16 20:01:26,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:26,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 20:01:26,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 20:01:26,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:26,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371090139] [2025-03-16 20:01:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371090139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710058444] [2025-03-16 20:01:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:26,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:26,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:26,566 INFO L87 Difference]: Start difference. First operand 87921 states and 198783 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:32,362 INFO L93 Difference]: Finished difference Result 186835 states and 466202 transitions. [2025-03-16 20:01:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:32,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-16 20:01:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:32,994 INFO L225 Difference]: With dead ends: 186835 [2025-03-16 20:01:32,994 INFO L226 Difference]: Without dead ends: 101047 [2025-03-16 20:01:33,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:33,253 INFO L435 NwaCegarLoop]: 4183 mSDtfsCounter, 4377 mSDsluCounter, 8273 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4391 SdHoareTripleChecker+Valid, 12456 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:33,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4391 Valid, 12456 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101047 states.