./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74f9bd5bd4d02445cc8b51e0daba1f22f33c6c5b4db852fb1ac615d474112387 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:05:49,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:05:49,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:05:49,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:05:49,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:05:49,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:05:49,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:05:49,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:05:49,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:05:49,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:05:49,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:05:49,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:05:49,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:05:49,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:05:49,534 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:05:49,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:05:49,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:05:49,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:05:49,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:05:49,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:05:49,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74f9bd5bd4d02445cc8b51e0daba1f22f33c6c5b4db852fb1ac615d474112387 [2025-02-05 17:05:49,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:05:49,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:05:49,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:05:49,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:05:49,801 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:05:49,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c [2025-02-05 17:05:51,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea8c138b/730739348de04fcfa047758dd6dbfdb1/FLAG4f8354c61 [2025-02-05 17:05:51,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:05:51,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c [2025-02-05 17:05:51,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea8c138b/730739348de04fcfa047758dd6dbfdb1/FLAG4f8354c61 [2025-02-05 17:05:52,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ea8c138b/730739348de04fcfa047758dd6dbfdb1 [2025-02-05 17:05:52,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:05:52,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:05:52,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:05:52,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:05:52,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:05:52,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:05:52" (1/1) ... [2025-02-05 17:05:52,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afb79a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:52, skipping insertion in model container [2025-02-05 17:05:52,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:05:52" (1/1) ... [2025-02-05 17:05:52,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:05:53,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[377069,377082] [2025-02-05 17:05:53,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:05:53,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:05:53,902 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:05:54,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[377069,377082] [2025-02-05 17:05:54,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:05:54,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:05:54,524 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:05:54,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54 WrapperNode [2025-02-05 17:05:54,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:05:54,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:05:54,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:05:54,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:05:54,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:54,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:54,939 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-02-05 17:05:54,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:05:54,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:05:54,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:05:54,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:05:54,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:54,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,087 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:05:55,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:05:55,315 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:05:55,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:05:55,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:05:55,316 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (1/1) ... [2025-02-05 17:05:55,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:05:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:05:55,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:05:55,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:05:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:05:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:05:55,363 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:05:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:05:55,363 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:05:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:05:55,363 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:05:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:05:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:05:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:05:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:05:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:05:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:05:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:05:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:05:55,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:05:55,479 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:05:55,480 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:06:02,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:06:02,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:06:02,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:06:02,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:06:02,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:06:02,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:06:02,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:06:02,502 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-02-05 17:06:02,502 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:06:02,608 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:06:02,608 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:06:02,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:06:02 BoogieIcfgContainer [2025-02-05 17:06:02,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:06:02,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:06:02,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:06:02,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:06:02,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:05:52" (1/3) ... [2025-02-05 17:06:02,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ec20c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:06:02, skipping insertion in model container [2025-02-05 17:06:02,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:54" (2/3) ... [2025-02-05 17:06:02,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ec20c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:06:02, skipping insertion in model container [2025-02-05 17:06:02,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:06:02" (3/3) ... [2025-02-05 17:06:02,619 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.11.cil-2.c [2025-02-05 17:06:02,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:06:02,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.11.cil-2.c that has 7 procedures, 2564 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-02-05 17:06:02,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:06:02,742 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;@664bbeee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:06:02,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:06:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:06:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:02,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:02,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1808491916, now seen corresponding path program 1 times [2025-02-05 17:06:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:02,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946416686] [2025-02-05 17:06:02,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:02,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:02,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:02,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946416686] [2025-02-05 17:06:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946416686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516615934] [2025-02-05 17:06:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:03,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:03,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:03,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:03,359 INFO L87 Difference]: Start difference. First operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-02-05 17:06:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:04,139 INFO L93 Difference]: Finished difference Result 5513 states and 9981 transitions. [2025-02-05 17:06:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:06:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:04,169 INFO L225 Difference]: With dead ends: 5513 [2025-02-05 17:06:04,169 INFO L226 Difference]: Without dead ends: 2898 [2025-02-05 17:06:04,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:04,183 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 5115 mSDsluCounter, 9229 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 13711 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:04,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 13711 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-02-05 17:06:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2871. [2025-02-05 17:06:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7876200640341515) internal successors, (5025), 2814 states have internal predecessors, (5025), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:06:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5116 transitions. [2025-02-05 17:06:04,320 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5116 transitions. Word has length 167 [2025-02-05 17:06:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:04,321 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5116 transitions. [2025-02-05 17:06:04,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-02-05 17:06:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5116 transitions. [2025-02-05 17:06:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:04,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:04,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:06:04,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:04,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1308698826, now seen corresponding path program 1 times [2025-02-05 17:06:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:04,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665162263] [2025-02-05 17:06:04,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:04,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665162263] [2025-02-05 17:06:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665162263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632486001] [2025-02-05 17:06:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:04,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:04,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:04,533 INFO L87 Difference]: Start difference. First operand 2871 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:04,888 INFO L93 Difference]: Finished difference Result 3674 states and 6383 transitions. [2025-02-05 17:06:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:04,898 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 17:06:04,899 INFO L226 Difference]: Without dead ends: 2943 [2025-02-05 17:06:04,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:04,901 INFO L435 NwaCegarLoop]: 4401 mSDtfsCounter, 4736 mSDsluCounter, 8657 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:04,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 13058 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-02-05 17:06:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2871. [2025-02-05 17:06:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7869085734614016) internal successors, (5023), 2814 states have internal predecessors, (5023), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:06:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5114 transitions. [2025-02-05 17:06:04,964 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5114 transitions. Word has length 167 [2025-02-05 17:06:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5114 transitions. [2025-02-05 17:06:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5114 transitions. [2025-02-05 17:06:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:04,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:04,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:04,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:06:04,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:04,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1139555051, now seen corresponding path program 1 times [2025-02-05 17:06:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41541633] [2025-02-05 17:06:04,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:04,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:04,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:04,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:04,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41541633] [2025-02-05 17:06:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41541633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124284] [2025-02-05 17:06:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:05,156 INFO L87 Difference]: Start difference. First operand 2871 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:06,043 INFO L93 Difference]: Finished difference Result 4069 states and 6993 transitions. [2025-02-05 17:06:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:06,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:06,058 INFO L225 Difference]: With dead ends: 4069 [2025-02-05 17:06:06,059 INFO L226 Difference]: Without dead ends: 3338 [2025-02-05 17:06:06,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:06,063 INFO L435 NwaCegarLoop]: 4725 mSDtfsCounter, 5048 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:06,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 18972 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-02-05 17:06:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3219. [2025-02-05 17:06:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3132 states have (on average 1.7589399744572158) internal successors, (5509), 3136 states have internal predecessors, (5509), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:06:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5643 transitions. [2025-02-05 17:06:06,156 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5643 transitions. Word has length 167 [2025-02-05 17:06:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5643 transitions. [2025-02-05 17:06:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5643 transitions. [2025-02-05 17:06:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:06,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:06,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:06,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:06:06,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:06,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1221205846, now seen corresponding path program 1 times [2025-02-05 17:06:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293039337] [2025-02-05 17:06:06,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:06,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:06,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:06,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293039337] [2025-02-05 17:06:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293039337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860484451] [2025-02-05 17:06:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:06,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:06,417 INFO L87 Difference]: Start difference. First operand 3219 states and 5643 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:07,405 INFO L93 Difference]: Finished difference Result 5174 states and 8701 transitions. [2025-02-05 17:06:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:07,430 INFO L225 Difference]: With dead ends: 5174 [2025-02-05 17:06:07,430 INFO L226 Difference]: Without dead ends: 4095 [2025-02-05 17:06:07,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:07,437 INFO L435 NwaCegarLoop]: 4721 mSDtfsCounter, 5043 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 18956 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:07,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 18956 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:06:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-02-05 17:06:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3958. [2025-02-05 17:06:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3815 states have (on average 1.7195281782437746) internal successors, (6560), 3823 states have internal predecessors, (6560), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:06:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6786 transitions. [2025-02-05 17:06:07,586 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6786 transitions. Word has length 167 [2025-02-05 17:06:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:07,586 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6786 transitions. [2025-02-05 17:06:07,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6786 transitions. [2025-02-05 17:06:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:07,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:07,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:07,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:06:07,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:07,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1196492555, now seen corresponding path program 1 times [2025-02-05 17:06:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579577357] [2025-02-05 17:06:07,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:07,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:07,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:07,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579577357] [2025-02-05 17:06:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579577357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962121418] [2025-02-05 17:06:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:07,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:07,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:07,761 INFO L87 Difference]: Start difference. First operand 3958 states and 6786 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:08,800 INFO L93 Difference]: Finished difference Result 7551 states and 12454 transitions. [2025-02-05 17:06:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:08,833 INFO L225 Difference]: With dead ends: 7551 [2025-02-05 17:06:08,833 INFO L226 Difference]: Without dead ends: 5733 [2025-02-05 17:06:08,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:08,845 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5038 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 18944 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:08,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 18944 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:06:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-02-05 17:06:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5559. [2025-02-05 17:06:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 5298 states have (on average 1.6776141940354852) internal successors, (8888), 5320 states have internal predecessors, (8888), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:06:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9322 transitions. [2025-02-05 17:06:09,059 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9322 transitions. Word has length 167 [2025-02-05 17:06:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 5559 states and 9322 transitions. [2025-02-05 17:06:09,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9322 transitions. [2025-02-05 17:06:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:09,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:09,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:06:09,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1274482826, now seen corresponding path program 1 times [2025-02-05 17:06:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020269615] [2025-02-05 17:06:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:09,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:09,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:09,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020269615] [2025-02-05 17:06:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020269615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:09,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988136429] [2025-02-05 17:06:09,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:09,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:09,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:09,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:09,251 INFO L87 Difference]: Start difference. First operand 5559 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:10,233 INFO L93 Difference]: Finished difference Result 12778 states and 20948 transitions. [2025-02-05 17:06:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:10,278 INFO L225 Difference]: With dead ends: 12778 [2025-02-05 17:06:10,280 INFO L226 Difference]: Without dead ends: 9359 [2025-02-05 17:06:10,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:10,292 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5033 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:10,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 18932 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:06:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-02-05 17:06:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9112. [2025-02-05 17:06:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6503431429568454) internal successors, (14188), 8665 states have internal predecessors, (14188), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:06:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15134 transitions. [2025-02-05 17:06:10,528 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15134 transitions. Word has length 167 [2025-02-05 17:06:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15134 transitions. [2025-02-05 17:06:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15134 transitions. [2025-02-05 17:06:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:10,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:10,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:10,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:06:10,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:10,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1078306005, now seen corresponding path program 1 times [2025-02-05 17:06:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:10,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226897973] [2025-02-05 17:06:10,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:10,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:10,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226897973] [2025-02-05 17:06:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226897973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512057954] [2025-02-05 17:06:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:10,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:10,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:10,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:10,698 INFO L87 Difference]: Start difference. First operand 9112 states and 15134 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:11,135 INFO L93 Difference]: Finished difference Result 17578 states and 29308 transitions. [2025-02-05 17:06:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:11,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:11,168 INFO L225 Difference]: With dead ends: 17578 [2025-02-05 17:06:11,168 INFO L226 Difference]: Without dead ends: 10606 [2025-02-05 17:06:11,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:11,188 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4728 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 13020 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:11,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 13020 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2025-02-05 17:06:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 9112. [2025-02-05 17:06:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6483657089682446) internal successors, (14171), 8665 states have internal predecessors, (14171), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:06:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15117 transitions. [2025-02-05 17:06:11,434 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15117 transitions. Word has length 167 [2025-02-05 17:06:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:11,434 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15117 transitions. [2025-02-05 17:06:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15117 transitions. [2025-02-05 17:06:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:11,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:11,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:11,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:06:11,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2137119244, now seen corresponding path program 1 times [2025-02-05 17:06:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421857333] [2025-02-05 17:06:11,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:11,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:11,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:11,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:11,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421857333] [2025-02-05 17:06:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421857333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599953355] [2025-02-05 17:06:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:11,637 INFO L87 Difference]: Start difference. First operand 9112 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:12,182 INFO L93 Difference]: Finished difference Result 17495 states and 29108 transitions. [2025-02-05 17:06:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:12,217 INFO L225 Difference]: With dead ends: 17495 [2025-02-05 17:06:12,218 INFO L226 Difference]: Without dead ends: 10523 [2025-02-05 17:06:12,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:12,236 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4725 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 13012 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:12,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 13012 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2025-02-05 17:06:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 9112. [2025-02-05 17:06:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6463882749796441) internal successors, (14154), 8665 states have internal predecessors, (14154), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:06:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15100 transitions. [2025-02-05 17:06:12,534 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15100 transitions. Word has length 167 [2025-02-05 17:06:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15100 transitions. [2025-02-05 17:06:12,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15100 transitions. [2025-02-05 17:06:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:12,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:12,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:06:12,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:12,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2102295307, now seen corresponding path program 1 times [2025-02-05 17:06:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603036203] [2025-02-05 17:06:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:12,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:12,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603036203] [2025-02-05 17:06:12,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603036203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:12,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728747180] [2025-02-05 17:06:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:12,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:12,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:12,675 INFO L87 Difference]: Start difference. First operand 9112 states and 15100 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:13,704 INFO L93 Difference]: Finished difference Result 24277 states and 40176 transitions. [2025-02-05 17:06:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:13,760 INFO L225 Difference]: With dead ends: 24277 [2025-02-05 17:06:13,760 INFO L226 Difference]: Without dead ends: 17305 [2025-02-05 17:06:13,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:13,779 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5009 mSDsluCounter, 14170 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 18868 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:13,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 18868 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2025-02-05 17:06:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16974. [2025-02-05 17:06:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6395546329496131) internal successors, (26064), 16111 states have internal predecessors, (26064), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:06:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28418 transitions. [2025-02-05 17:06:14,230 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28418 transitions. Word has length 167 [2025-02-05 17:06:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:14,231 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28418 transitions. [2025-02-05 17:06:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28418 transitions. [2025-02-05 17:06:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:14,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:14,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:06:14,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:14,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 254132692, now seen corresponding path program 1 times [2025-02-05 17:06:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129919171] [2025-02-05 17:06:14,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:14,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129919171] [2025-02-05 17:06:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129919171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420298493] [2025-02-05 17:06:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:14,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:14,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:14,332 INFO L87 Difference]: Start difference. First operand 16974 states and 28418 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:15,202 INFO L93 Difference]: Finished difference Result 35483 states and 60552 transitions. [2025-02-05 17:06:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:15,256 INFO L225 Difference]: With dead ends: 35483 [2025-02-05 17:06:15,256 INFO L226 Difference]: Without dead ends: 20649 [2025-02-05 17:06:15,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:15,287 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4721 mSDsluCounter, 8618 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 12998 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:15,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 12998 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:06:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2025-02-05 17:06:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 16974. [2025-02-05 17:06:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.637478769579166) internal successors, (26031), 16111 states have internal predecessors, (26031), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:06:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28385 transitions. [2025-02-05 17:06:15,813 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28385 transitions. Word has length 167 [2025-02-05 17:06:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:15,814 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28385 transitions. [2025-02-05 17:06:15,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28385 transitions. [2025-02-05 17:06:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:15,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:15,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:06:15,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1193874155, now seen corresponding path program 1 times [2025-02-05 17:06:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882359390] [2025-02-05 17:06:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:15,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:15,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:15,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:15,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:15,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882359390] [2025-02-05 17:06:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882359390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358415930] [2025-02-05 17:06:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:15,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:15,960 INFO L87 Difference]: Start difference. First operand 16974 states and 28385 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:16,812 INFO L93 Difference]: Finished difference Result 35238 states and 59996 transitions. [2025-02-05 17:06:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:16,868 INFO L225 Difference]: With dead ends: 35238 [2025-02-05 17:06:16,869 INFO L226 Difference]: Without dead ends: 20404 [2025-02-05 17:06:16,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:16,902 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4718 mSDsluCounter, 8613 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12990 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:16,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12990 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:06:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2025-02-05 17:06:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 16974. [2025-02-05 17:06:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6354029062087185) internal successors, (25998), 16111 states have internal predecessors, (25998), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:06:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28352 transitions. [2025-02-05 17:06:17,600 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28352 transitions. Word has length 167 [2025-02-05 17:06:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:17,600 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28352 transitions. [2025-02-05 17:06:17,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28352 transitions. [2025-02-05 17:06:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:17,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:06:17,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:17,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 144889268, now seen corresponding path program 1 times [2025-02-05 17:06:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120388286] [2025-02-05 17:06:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:17,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:17,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:17,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:17,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120388286] [2025-02-05 17:06:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120388286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63509800] [2025-02-05 17:06:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:17,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:17,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:17,725 INFO L87 Difference]: Start difference. First operand 16974 states and 28352 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:19,254 INFO L93 Difference]: Finished difference Result 52501 states and 89027 transitions. [2025-02-05 17:06:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:19,406 INFO L225 Difference]: With dead ends: 52501 [2025-02-05 17:06:19,407 INFO L226 Difference]: Without dead ends: 37667 [2025-02-05 17:06:19,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:19,455 INFO L435 NwaCegarLoop]: 4683 mSDtfsCounter, 5332 mSDsluCounter, 14122 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 18805 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:19,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 18805 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37667 states. [2025-02-05 17:06:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37667 to 34465. [2025-02-05 17:06:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6466670815958175) internal successors, (52914), 32802 states have internal predecessors, (52914), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:06:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59556 transitions. [2025-02-05 17:06:21,103 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59556 transitions. Word has length 167 [2025-02-05 17:06:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:21,104 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59556 transitions. [2025-02-05 17:06:21,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59556 transitions. [2025-02-05 17:06:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:21,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:21,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:06:21,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 326622517, now seen corresponding path program 1 times [2025-02-05 17:06:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867530484] [2025-02-05 17:06:21,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:21,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867530484] [2025-02-05 17:06:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867530484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:21,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:21,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018969371] [2025-02-05 17:06:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:21,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:21,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:21,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:21,235 INFO L87 Difference]: Start difference. First operand 34465 states and 59556 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:22,925 INFO L93 Difference]: Finished difference Result 75562 states and 134700 transitions. [2025-02-05 17:06:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:23,190 INFO L225 Difference]: With dead ends: 75562 [2025-02-05 17:06:23,190 INFO L226 Difference]: Without dead ends: 43237 [2025-02-05 17:06:23,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:23,341 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4712 mSDsluCounter, 8602 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12974 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:23,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12974 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43237 states. [2025-02-05 17:06:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43237 to 34465. [2025-02-05 17:06:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.644644301985436) internal successors, (52849), 32802 states have internal predecessors, (52849), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:06:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59491 transitions. [2025-02-05 17:06:25,440 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59491 transitions. Word has length 167 [2025-02-05 17:06:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:25,440 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59491 transitions. [2025-02-05 17:06:25,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59491 transitions. [2025-02-05 17:06:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:25,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:25,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:06:25,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 471032212, now seen corresponding path program 1 times [2025-02-05 17:06:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815690154] [2025-02-05 17:06:25,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:25,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:25,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:25,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815690154] [2025-02-05 17:06:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815690154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655712260] [2025-02-05 17:06:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:25,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:25,533 INFO L87 Difference]: Start difference. First operand 34465 states and 59491 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:27,485 INFO L93 Difference]: Finished difference Result 74100 states and 131646 transitions. [2025-02-05 17:06:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:27,691 INFO L225 Difference]: With dead ends: 74100 [2025-02-05 17:06:27,691 INFO L226 Difference]: Without dead ends: 41775 [2025-02-05 17:06:27,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:27,781 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4708 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:27,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12960 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2025-02-05 17:06:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 34465. [2025-02-05 17:06:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6426215223750544) internal successors, (52784), 32802 states have internal predecessors, (52784), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:06:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59426 transitions. [2025-02-05 17:06:29,490 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59426 transitions. Word has length 167 [2025-02-05 17:06:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:29,491 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59426 transitions. [2025-02-05 17:06:29,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59426 transitions. [2025-02-05 17:06:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:29,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:29,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:29,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:06:29,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1338871373, now seen corresponding path program 1 times [2025-02-05 17:06:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221943324] [2025-02-05 17:06:29,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:29,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:29,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221943324] [2025-02-05 17:06:29,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221943324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:29,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:29,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873417145] [2025-02-05 17:06:29,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:29,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:29,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:29,577 INFO L87 Difference]: Start difference. First operand 34465 states and 59426 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:31,337 INFO L93 Difference]: Finished difference Result 73369 states and 130054 transitions. [2025-02-05 17:06:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:31,452 INFO L225 Difference]: With dead ends: 73369 [2025-02-05 17:06:31,452 INFO L226 Difference]: Without dead ends: 41044 [2025-02-05 17:06:31,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:31,503 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4705 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12952 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:31,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12952 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41044 states. [2025-02-05 17:06:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41044 to 34465. [2025-02-05 17:06:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6405987427646729) internal successors, (52719), 32802 states have internal predecessors, (52719), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:06:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59361 transitions. [2025-02-05 17:06:33,350 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59361 transitions. Word has length 167 [2025-02-05 17:06:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:33,351 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59361 transitions. [2025-02-05 17:06:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59361 transitions. [2025-02-05 17:06:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:33,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:33,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:06:33,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1812897356, now seen corresponding path program 1 times [2025-02-05 17:06:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133542727] [2025-02-05 17:06:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:33,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:33,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:33,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133542727] [2025-02-05 17:06:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133542727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413151452] [2025-02-05 17:06:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:33,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:33,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:33,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:33,501 INFO L87 Difference]: Start difference. First operand 34465 states and 59361 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:36,607 INFO L93 Difference]: Finished difference Result 108112 states and 193016 transitions. [2025-02-05 17:06:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:36,864 INFO L225 Difference]: With dead ends: 108112 [2025-02-05 17:06:36,864 INFO L226 Difference]: Without dead ends: 75787 [2025-02-05 17:06:36,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:06:36,951 INFO L435 NwaCegarLoop]: 4661 mSDtfsCounter, 5150 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:36,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 18722 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2025-02-05 17:06:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 72024. [2025-02-05 17:06:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72024 states, 66731 states have (on average 1.6506721014221277) internal successors, (110151), 68793 states have internal predecessors, (110151), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-02-05 17:06:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72024 states to 72024 states and 131449 transitions. [2025-02-05 17:06:40,854 INFO L78 Accepts]: Start accepts. Automaton has 72024 states and 131449 transitions. Word has length 167 [2025-02-05 17:06:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:40,854 INFO L471 AbstractCegarLoop]: Abstraction has 72024 states and 131449 transitions. [2025-02-05 17:06:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 72024 states and 131449 transitions. [2025-02-05 17:06:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:40,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:40,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:40,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:06:40,870 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2105283181, now seen corresponding path program 1 times [2025-02-05 17:06:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946644031] [2025-02-05 17:06:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:40,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:40,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:40,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946644031] [2025-02-05 17:06:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946644031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:40,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703918414] [2025-02-05 17:06:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:40,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:40,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:40,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:40,952 INFO L87 Difference]: Start difference. First operand 72024 states and 131449 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:45,994 INFO L93 Difference]: Finished difference Result 157231 states and 299630 transitions. [2025-02-05 17:06:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:45,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:06:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:46,318 INFO L225 Difference]: With dead ends: 157231 [2025-02-05 17:06:46,318 INFO L226 Difference]: Without dead ends: 87347 [2025-02-05 17:06:46,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:46,440 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4701 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:46,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 12938 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87347 states. [2025-02-05 17:06:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87347 to 72024. [2025-02-05 17:06:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72024 states, 66731 states have (on average 1.6487389668969445) internal successors, (110022), 68793 states have internal predecessors, (110022), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-02-05 17:06:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72024 states to 72024 states and 131320 transitions. [2025-02-05 17:06:50,910 INFO L78 Accepts]: Start accepts. Automaton has 72024 states and 131320 transitions. Word has length 167 [2025-02-05 17:06:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:50,911 INFO L471 AbstractCegarLoop]: Abstraction has 72024 states and 131320 transitions. [2025-02-05 17:06:50,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-02-05 17:06:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 72024 states and 131320 transitions. [2025-02-05 17:06:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:50,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:50,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:06:50,929 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -175052332, now seen corresponding path program 1 times [2025-02-05 17:06:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443225654] [2025-02-05 17:06:50,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:50,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:50,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:50,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:50,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443225654] [2025-02-05 17:06:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443225654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:06:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138078509] [2025-02-05 17:06:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:06:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:06:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:06:51,058 INFO L87 Difference]: Start difference. First operand 72024 states and 131320 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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)