./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.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_label43+token_ring.06.cil-1.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 653a8e34239233d69d9a38d78b85981ab63654836b879da54ad0b88422f00ccf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:09:47,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:09:47,419 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:09:47,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:09:47,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:09:47,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:09:47,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:09:47,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:09:47,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:09:47,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:09:47,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:09:47,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:09:47,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:09:47,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:09:47,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:47,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:09:47,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:09:47,443 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 -> 653a8e34239233d69d9a38d78b85981ab63654836b879da54ad0b88422f00ccf [2025-02-05 17:09:47,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:09:47,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:09:47,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:09:47,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:09:47,692 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:09:47,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c [2025-02-05 17:09:48,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4570080a6/7235630c48134342bacb2a9ed72bfe86/FLAG900d05cfb [2025-02-05 17:09:49,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:09:49,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c [2025-02-05 17:09:49,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4570080a6/7235630c48134342bacb2a9ed72bfe86/FLAG900d05cfb [2025-02-05 17:09:49,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4570080a6/7235630c48134342bacb2a9ed72bfe86 [2025-02-05 17:09:49,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:09:49,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:09:49,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:49,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:09:49,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:09:49,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:49" (1/1) ... [2025-02-05 17:09:49,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:49, skipping insertion in model container [2025-02-05 17:09:49,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:49" (1/1) ... [2025-02-05 17:09:49,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:09:50,747 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_label43+token_ring.06.cil-1.c[381679,381692] [2025-02-05 17:09:50,773 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_label43+token_ring.06.cil-1.c[383339,383352] [2025-02-05 17:09:50,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:50,989 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:09:51,475 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_label43+token_ring.06.cil-1.c[381679,381692] [2025-02-05 17:09:51,480 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_label43+token_ring.06.cil-1.c[383339,383352] [2025-02-05 17:09:51,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:51,548 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:09:51,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51 WrapperNode [2025-02-05 17:09:51,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:51,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:51,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:09:51,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:09:51,558 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:09:51" (1/1) ... [2025-02-05 17:09:51,617 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:09:51" (1/1) ... [2025-02-05 17:09:51,910 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 12849 [2025-02-05 17:09:51,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:51,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:09:51,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:09:51,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:09:51,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:51,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:51,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,049 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:09:52,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:09:52,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:09:52,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:09:52,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:09:52,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (1/1) ... [2025-02-05 17:09:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:52,521 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:09:52,524 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:09:52,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:09:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:09:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:09:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:09:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:09:52,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:09:52,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:09:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:09:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:09:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:09:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:09:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:09:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:09:52,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:09:52,645 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:09:58,851 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:09:58,852 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:09:58,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:09:58,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:09:58,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:09:58,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:09:58,854 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:09:59,054 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2025-02-05 17:09:59,054 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:09:59,100 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:09:59,100 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:09:59,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:59 BoogieIcfgContainer [2025-02-05 17:09:59,101 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:09:59,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:09:59,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:09:59,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:09:59,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:09:49" (1/3) ... [2025-02-05 17:09:59,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f4766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:59, skipping insertion in model container [2025-02-05 17:09:59,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:51" (2/3) ... [2025-02-05 17:09:59,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f4766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:59, skipping insertion in model container [2025-02-05 17:09:59,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:59" (3/3) ... [2025-02-05 17:09:59,111 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.06.cil-1.c [2025-02-05 17:09:59,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:09:59,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.06.cil-1.c that has 8 procedures, 2437 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-05 17:09:59,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:09:59,242 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;@29fe48b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:09:59,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:09:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 2437 states, 2405 states have (on average 1.8424116424116423) internal successors, (4431), 2410 states have internal predecessors, (4431), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:09:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:09:59,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:59,270 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] [2025-02-05 17:09:59,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:59,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1532484664, now seen corresponding path program 1 times [2025-02-05 17:09:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625984180] [2025-02-05 17:09:59,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:09:59,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:09:59,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:59,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:59,728 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:09:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625984180] [2025-02-05 17:09:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625984180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:59,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839056181] [2025-02-05 17:09:59,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:59,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:59,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:59,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:59,759 INFO L87 Difference]: Start difference. First operand has 2437 states, 2405 states have (on average 1.8424116424116423) internal successors, (4431), 2410 states have internal predecessors, (4431), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:00,345 INFO L93 Difference]: Finished difference Result 5120 states and 9343 transitions. [2025-02-05 17:10:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:10:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:00,375 INFO L225 Difference]: With dead ends: 5120 [2025-02-05 17:10:00,375 INFO L226 Difference]: Without dead ends: 2627 [2025-02-05 17:10:00,386 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:10:00,390 INFO L435 NwaCegarLoop]: 4323 mSDtfsCounter, 4694 mSDsluCounter, 8808 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 13131 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:00,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 13131 Invalid, 439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-02-05 17:10:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2608. [2025-02-05 17:10:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2556 states have (on average 1.8094679186228482) internal successors, (4625), 2560 states have internal predecessors, (4625), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-05 17:10:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 4698 transitions. [2025-02-05 17:10:00,535 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 4698 transitions. Word has length 113 [2025-02-05 17:10:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:00,535 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 4698 transitions. [2025-02-05 17:10:00,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 4698 transitions. [2025-02-05 17:10:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:00,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:00,541 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] [2025-02-05 17:10:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:00,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:00,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1035358266, now seen corresponding path program 1 times [2025-02-05 17:10:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354437113] [2025-02-05 17:10:00,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:00,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:00,714 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:10:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354437113] [2025-02-05 17:10:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354437113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905041907] [2025-02-05 17:10:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:00,718 INFO L87 Difference]: Start difference. First operand 2608 states and 4698 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:00,997 INFO L93 Difference]: Finished difference Result 3123 states and 5497 transitions. [2025-02-05 17:10:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:01,009 INFO L225 Difference]: With dead ends: 3123 [2025-02-05 17:10:01,010 INFO L226 Difference]: Without dead ends: 2650 [2025-02-05 17:10:01,014 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:10:01,015 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 4444 mSDsluCounter, 8385 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4458 SdHoareTripleChecker+Valid, 12627 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4458 Valid, 12627 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-02-05 17:10:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2608. [2025-02-05 17:10:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2556 states have (on average 1.8086854460093897) internal successors, (4623), 2560 states have internal predecessors, (4623), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-05 17:10:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 4696 transitions. [2025-02-05 17:10:01,177 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 4696 transitions. Word has length 113 [2025-02-05 17:10:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:01,178 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 4696 transitions. [2025-02-05 17:10:01,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 4696 transitions. [2025-02-05 17:10:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:01,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:01,180 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] [2025-02-05 17:10:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:01,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash -359665657, now seen corresponding path program 1 times [2025-02-05 17:10:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470523464] [2025-02-05 17:10:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:01,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:01,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:01,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:01,335 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:10:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470523464] [2025-02-05 17:10:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470523464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425226741] [2025-02-05 17:10:01,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:01,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:01,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:01,337 INFO L87 Difference]: Start difference. First operand 2608 states and 4696 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:01,859 INFO L93 Difference]: Finished difference Result 3375 states and 5874 transitions. [2025-02-05 17:10:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:01,872 INFO L225 Difference]: With dead ends: 3375 [2025-02-05 17:10:01,872 INFO L226 Difference]: Without dead ends: 2902 [2025-02-05 17:10:01,874 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:10:01,875 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4616 mSDsluCounter, 13372 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 17824 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:01,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 17824 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-02-05 17:10:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2831. [2025-02-05 17:10:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2757 states have (on average 1.785999274573812) internal successors, (4924), 2762 states have internal predecessors, (4924), 52 states have call successors, (52), 19 states have call predecessors, (52), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-02-05 17:10:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5030 transitions. [2025-02-05 17:10:01,951 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5030 transitions. Word has length 113 [2025-02-05 17:10:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5030 transitions. [2025-02-05 17:10:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5030 transitions. [2025-02-05 17:10:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:01,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:01,954 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] [2025-02-05 17:10:01,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:01,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:01,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1169153114, now seen corresponding path program 1 times [2025-02-05 17:10:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270655952] [2025-02-05 17:10:01,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:01,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:01,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:01,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:01,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:02,097 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:10:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270655952] [2025-02-05 17:10:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270655952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313367181] [2025-02-05 17:10:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:02,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:02,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:02,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:02,101 INFO L87 Difference]: Start difference. First operand 2831 states and 5030 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:02,611 INFO L93 Difference]: Finished difference Result 4075 states and 6937 transitions. [2025-02-05 17:10:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:02,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:02,627 INFO L225 Difference]: With dead ends: 4075 [2025-02-05 17:10:02,628 INFO L226 Difference]: Without dead ends: 3379 [2025-02-05 17:10:02,631 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:10:02,632 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 4611 mSDsluCounter, 13360 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4625 SdHoareTripleChecker+Valid, 17808 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:02,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4625 Valid, 17808 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-02-05 17:10:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3300. [2025-02-05 17:10:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3180 states have (on average 1.75) internal successors, (5565), 3189 states have internal predecessors, (5565), 82 states have call successors, (82), 31 states have call predecessors, (82), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-02-05 17:10:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5743 transitions. [2025-02-05 17:10:02,723 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5743 transitions. Word has length 113 [2025-02-05 17:10:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:02,724 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5743 transitions. [2025-02-05 17:10:02,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5743 transitions. [2025-02-05 17:10:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:02,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:02,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:02,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1610907609, now seen corresponding path program 1 times [2025-02-05 17:10:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26219114] [2025-02-05 17:10:02,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:02,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:02,850 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:10:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26219114] [2025-02-05 17:10:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26219114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428783541] [2025-02-05 17:10:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:02,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:02,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:02,853 INFO L87 Difference]: Start difference. First operand 3300 states and 5743 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:03,425 INFO L93 Difference]: Finished difference Result 5562 states and 9240 transitions. [2025-02-05 17:10:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:03,439 INFO L225 Difference]: With dead ends: 5562 [2025-02-05 17:10:03,439 INFO L226 Difference]: Without dead ends: 4397 [2025-02-05 17:10:03,441 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:10:03,442 INFO L435 NwaCegarLoop]: 4445 mSDtfsCounter, 4606 mSDsluCounter, 13351 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 17796 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:03,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 17796 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-02-05 17:10:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4301. [2025-02-05 17:10:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4301 states, 4083 states have (on average 1.7029145236345824) internal successors, (6953), 4106 states have internal predecessors, (6953), 142 states have call successors, (142), 55 states have call predecessors, (142), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-02-05 17:10:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 7299 transitions. [2025-02-05 17:10:03,578 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 7299 transitions. Word has length 113 [2025-02-05 17:10:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 4301 states and 7299 transitions. [2025-02-05 17:10:03,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 7299 transitions. [2025-02-05 17:10:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:03,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:03,585 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] [2025-02-05 17:10:03,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:03,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1625157754, now seen corresponding path program 1 times [2025-02-05 17:10:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938762479] [2025-02-05 17:10:03,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:03,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:03,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:03,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:03,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:03,721 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:10:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938762479] [2025-02-05 17:10:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938762479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024181162] [2025-02-05 17:10:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:03,722 INFO L87 Difference]: Start difference. First operand 4301 states and 7299 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:04,324 INFO L93 Difference]: Finished difference Result 8769 states and 14354 transitions. [2025-02-05 17:10:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:04,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:04,355 INFO L225 Difference]: With dead ends: 8769 [2025-02-05 17:10:04,355 INFO L226 Difference]: Without dead ends: 6603 [2025-02-05 17:10:04,365 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:10:04,365 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4626 mSDsluCounter, 12917 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 17181 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:04,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 17181 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2025-02-05 17:10:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 6474. [2025-02-05 17:10:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6474 states, 6042 states have (on average 1.6572327044025157) internal successors, (10013), 6111 states have internal predecessors, (10013), 262 states have call successors, (262), 103 states have call predecessors, (262), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-02-05 17:10:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 10791 transitions. [2025-02-05 17:10:04,588 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 10791 transitions. Word has length 113 [2025-02-05 17:10:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:04,588 INFO L471 AbstractCegarLoop]: Abstraction has 6474 states and 10791 transitions. [2025-02-05 17:10:04,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 10791 transitions. [2025-02-05 17:10:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:04,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:04,593 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] [2025-02-05 17:10:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:04,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1699518535, now seen corresponding path program 1 times [2025-02-05 17:10:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312809716] [2025-02-05 17:10:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:04,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:04,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:04,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:04,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:04,688 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:10:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312809716] [2025-02-05 17:10:04,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312809716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:04,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252136494] [2025-02-05 17:10:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:04,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:04,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:04,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:04,691 INFO L87 Difference]: Start difference. First operand 6474 states and 10791 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:05,310 INFO L93 Difference]: Finished difference Result 15808 states and 26084 transitions. [2025-02-05 17:10:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:05,422 INFO L225 Difference]: With dead ends: 15808 [2025-02-05 17:10:05,422 INFO L226 Difference]: Without dead ends: 11469 [2025-02-05 17:10:05,432 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:10:05,433 INFO L435 NwaCegarLoop]: 4439 mSDtfsCounter, 4596 mSDsluCounter, 13333 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4610 SdHoareTripleChecker+Valid, 17772 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:05,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4610 Valid, 17772 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11469 states. [2025-02-05 17:10:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11469 to 11279. [2025-02-05 17:10:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11279 states, 10365 states have (on average 1.6286541244573083) internal successors, (16881), 10580 states have internal predecessors, (16881), 502 states have call successors, (502), 199 states have call predecessors, (502), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-02-05 17:10:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11279 states to 11279 states and 18907 transitions. [2025-02-05 17:10:05,744 INFO L78 Accepts]: Start accepts. Automaton has 11279 states and 18907 transitions. Word has length 113 [2025-02-05 17:10:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 11279 states and 18907 transitions. [2025-02-05 17:10:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 11279 states and 18907 transitions. [2025-02-05 17:10:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:05,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:05,750 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] [2025-02-05 17:10:05,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:05,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:05,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1656917146, now seen corresponding path program 1 times [2025-02-05 17:10:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79223703] [2025-02-05 17:10:05,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:05,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:05,845 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:10:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79223703] [2025-02-05 17:10:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79223703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:05,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978941195] [2025-02-05 17:10:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:05,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:05,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:05,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:05,847 INFO L87 Difference]: Start difference. First operand 11279 states and 18907 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:06,810 INFO L93 Difference]: Finished difference Result 33051 states and 56387 transitions. [2025-02-05 17:10:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:06,894 INFO L225 Difference]: With dead ends: 33051 [2025-02-05 17:10:06,895 INFO L226 Difference]: Without dead ends: 23907 [2025-02-05 17:10:06,926 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:10:06,927 INFO L435 NwaCegarLoop]: 4434 mSDtfsCounter, 4785 mSDsluCounter, 13313 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4806 SdHoareTripleChecker+Valid, 17747 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4806 Valid, 17747 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23907 states. [2025-02-05 17:10:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23907 to 22008. [2025-02-05 17:10:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22008 states, 20000 states have (on average 1.62405) internal successors, (32481), 20669 states have internal predecessors, (32481), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-02-05 17:10:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22008 states to 22008 states and 38475 transitions. [2025-02-05 17:10:07,869 INFO L78 Accepts]: Start accepts. Automaton has 22008 states and 38475 transitions. Word has length 113 [2025-02-05 17:10:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:07,869 INFO L471 AbstractCegarLoop]: Abstraction has 22008 states and 38475 transitions. [2025-02-05 17:10:07,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22008 states and 38475 transitions. [2025-02-05 17:10:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:07,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:07,879 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] [2025-02-05 17:10:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:10:07,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2042283929, now seen corresponding path program 1 times [2025-02-05 17:10:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476910124] [2025-02-05 17:10:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:07,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:07,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:07,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:07,947 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:10:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476910124] [2025-02-05 17:10:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476910124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:07,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014149050] [2025-02-05 17:10:07,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:07,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:07,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:07,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:07,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:07,949 INFO L87 Difference]: Start difference. First operand 22008 states and 38475 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:08,975 INFO L93 Difference]: Finished difference Result 46998 states and 85238 transitions. [2025-02-05 17:10:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:09,095 INFO L225 Difference]: With dead ends: 46998 [2025-02-05 17:10:09,096 INFO L226 Difference]: Without dead ends: 27125 [2025-02-05 17:10:09,155 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:10:09,156 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 4433 mSDsluCounter, 8354 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 12581 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:09,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 12581 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27125 states. [2025-02-05 17:10:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27125 to 22008. [2025-02-05 17:10:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22008 states, 20000 states have (on average 1.6208) internal successors, (32416), 20669 states have internal predecessors, (32416), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-02-05 17:10:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22008 states to 22008 states and 38410 transitions. [2025-02-05 17:10:10,402 INFO L78 Accepts]: Start accepts. Automaton has 22008 states and 38410 transitions. Word has length 113 [2025-02-05 17:10:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:10,403 INFO L471 AbstractCegarLoop]: Abstraction has 22008 states and 38410 transitions. [2025-02-05 17:10:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22008 states and 38410 transitions. [2025-02-05 17:10:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:10,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:10,413 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] [2025-02-05 17:10:10,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:10:10,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -392147130, now seen corresponding path program 1 times [2025-02-05 17:10:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:10,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851823572] [2025-02-05 17:10:10,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:10,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:10,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:10,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:10,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851823572] [2025-02-05 17:10:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851823572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020364517] [2025-02-05 17:10:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:10,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:10,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:10,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:10,520 INFO L87 Difference]: Start difference. First operand 22008 states and 38410 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:12,127 INFO L93 Difference]: Finished difference Result 68398 states and 125614 transitions. [2025-02-05 17:10:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:12,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:12,319 INFO L225 Difference]: With dead ends: 68398 [2025-02-05 17:10:12,319 INFO L226 Difference]: Without dead ends: 48525 [2025-02-05 17:10:12,371 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:10:12,372 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4712 mSDsluCounter, 13290 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 17716 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:12,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 17716 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48525 states. [2025-02-05 17:10:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48525 to 45800. [2025-02-05 17:10:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45800 states, 41150 states have (on average 1.6247387606318346) internal successors, (66858), 43213 states have internal predecessors, (66858), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 86868 transitions. [2025-02-05 17:10:14,827 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 86868 transitions. Word has length 113 [2025-02-05 17:10:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 45800 states and 86868 transitions. [2025-02-05 17:10:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 86868 transitions. [2025-02-05 17:10:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:14,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:14,852 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] [2025-02-05 17:10:14,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:10:14,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:14,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1462198407, now seen corresponding path program 1 times [2025-02-05 17:10:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994471498] [2025-02-05 17:10:14,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:14,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:14,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:14,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:14,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:14,943 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:10:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994471498] [2025-02-05 17:10:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994471498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672540512] [2025-02-05 17:10:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:14,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:14,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:14,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:14,945 INFO L87 Difference]: Start difference. First operand 45800 states and 86868 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:17,078 INFO L93 Difference]: Finished difference Result 100410 states and 201722 transitions. [2025-02-05 17:10:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:17,426 INFO L225 Difference]: With dead ends: 100410 [2025-02-05 17:10:17,426 INFO L226 Difference]: Without dead ends: 56745 [2025-02-05 17:10:17,574 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:10:17,575 INFO L435 NwaCegarLoop]: 4222 mSDtfsCounter, 4429 mSDsluCounter, 8345 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 12567 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:17,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 12567 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56745 states. [2025-02-05 17:10:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56745 to 45800. [2025-02-05 17:10:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45800 states, 41150 states have (on average 1.6216038882138517) internal successors, (66729), 43213 states have internal predecessors, (66729), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 86739 transitions. [2025-02-05 17:10:21,251 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 86739 transitions. Word has length 113 [2025-02-05 17:10:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 45800 states and 86739 transitions. [2025-02-05 17:10:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 86739 transitions. [2025-02-05 17:10:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:21,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:21,272 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] [2025-02-05 17:10:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:10:21,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1664572634, now seen corresponding path program 1 times [2025-02-05 17:10:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003413273] [2025-02-05 17:10:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:21,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:21,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:21,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:21,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:21,356 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:10:21,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003413273] [2025-02-05 17:10:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003413273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631545292] [2025-02-05 17:10:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:21,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:21,359 INFO L87 Difference]: Start difference. First operand 45800 states and 86739 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:23,613 INFO L93 Difference]: Finished difference Result 98221 states and 197086 transitions. [2025-02-05 17:10:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2025-02-05 17:10:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:24,086 INFO L225 Difference]: With dead ends: 98221 [2025-02-05 17:10:24,086 INFO L226 Difference]: Without dead ends: 54556 [2025-02-05 17:10:24,161 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:10:24,163 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4426 mSDsluCounter, 8340 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4440 SdHoareTripleChecker+Valid, 12559 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:24,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4440 Valid, 12559 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54556 states. [2025-02-05 17:10:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54556 to 45800. [2025-02-05 17:10:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45800 states, 41150 states have (on average 1.6184690157958688) internal successors, (66600), 43213 states have internal predecessors, (66600), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45800 states to 45800 states and 86610 transitions. [2025-02-05 17:10:26,722 INFO L78 Accepts]: Start accepts. Automaton has 45800 states and 86610 transitions. Word has length 113 [2025-02-05 17:10:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:26,722 INFO L471 AbstractCegarLoop]: Abstraction has 45800 states and 86610 transitions. [2025-02-05 17:10:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:10:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 45800 states and 86610 transitions. [2025-02-05 17:10:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 17:10:26,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:26,738 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] [2025-02-05 17:10:26,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:10:26,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:26,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1421152423, now seen corresponding path program 1 times [2025-02-05 17:10:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761232939] [2025-02-05 17:10:26,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:26,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 17:10:26,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 17:10:26,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:26,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:26,817 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:10:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761232939] [2025-02-05 17:10:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761232939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555202155] [2025-02-05 17:10:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:26,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:26,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:26,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:26,819 INFO L87 Difference]: Start difference. First operand 45800 states and 86610 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)