./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.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_label49+token_ring.09.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 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:19:23,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:19:23,556 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:19:23,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:19:23,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:19:23,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:19:23,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:19:23,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:19:23,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:19:23,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:19:23,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:19:23,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:19:23,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:19:23,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:19:23,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:19:23,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:19:23,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:19:23,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:19:23,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:19:23,587 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 -> 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c [2025-02-05 17:19:23,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:19:23,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:19:23,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:19:23,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:19:23,820 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:19:23,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2025-02-05 17:19:24,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b6c96e8/9f00b59623b043d788afd3986e17fc4d/FLAGd80ad6ab7 [2025-02-05 17:19:25,415 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:19:25,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2025-02-05 17:19:25,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b6c96e8/9f00b59623b043d788afd3986e17fc4d/FLAGd80ad6ab7 [2025-02-05 17:19:25,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4b6c96e8/9f00b59623b043d788afd3986e17fc4d [2025-02-05 17:19:25,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:19:25,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:19:25,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:19:25,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:19:25,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:19:25,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:19:25" (1/1) ... [2025-02-05 17:19:25,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:25, skipping insertion in model container [2025-02-05 17:19:25,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:19:25" (1/1) ... [2025-02-05 17:19:26,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:19:27,368 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_label49+token_ring.09.cil-1.c[380593,380606] [2025-02-05 17:19:27,400 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_label49+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:19:27,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:19:27,635 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:19:28,126 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_label49+token_ring.09.cil-1.c[380593,380606] [2025-02-05 17:19:28,130 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_label49+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:19:28,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:19:28,222 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:19:28,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28 WrapperNode [2025-02-05 17:19:28,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:19:28,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:19:28,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:19:28,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:19:28,229 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:19:28" (1/1) ... [2025-02-05 17:19:28,272 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:19:28" (1/1) ... [2025-02-05 17:19:28,638 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-02-05 17:19:28,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:19:28,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:19:28,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:19:28,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:19:28,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,753 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:19:28,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:19:28,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:19:28,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:19:28,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:19:28,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (1/1) ... [2025-02-05 17:19:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:19:28,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:29,010 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:19:29,012 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:19:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:19:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:19:29,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:19:29,109 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:19:29,110 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:19:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:19:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:19:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:19:35,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:19:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:19:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:19:35,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:19:35,796 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-02-05 17:19:35,797 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:19:35,864 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:19:35,864 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:19:35,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:19:35 BoogieIcfgContainer [2025-02-05 17:19:35,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:19:35,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:19:35,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:19:35,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:19:35,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:19:25" (1/3) ... [2025-02-05 17:19:35,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:19:35, skipping insertion in model container [2025-02-05 17:19:35,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:19:28" (2/3) ... [2025-02-05 17:19:35,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:19:35, skipping insertion in model container [2025-02-05 17:19:35,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:19:35" (3/3) ... [2025-02-05 17:19:35,874 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.09.cil-1.c [2025-02-05 17:19:35,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:19:35,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.09.cil-1.c that has 7 procedures, 2510 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:19:36,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:19:36,091 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;@71336d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:19:36,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:19:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:19:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:36,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:36,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:36,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:36,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:36,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1505179624, now seen corresponding path program 1 times [2025-02-05 17:19:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382298303] [2025-02-05 17:19:36,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:36,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:36,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:36,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:36,631 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:19:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382298303] [2025-02-05 17:19:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382298303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800761085] [2025-02-05 17:19:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:36,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:36,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:36,661 INFO L87 Difference]: Start difference. First operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:37,343 INFO L93 Difference]: Finished difference Result 5347 states and 9709 transitions. [2025-02-05 17:19:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:19:37,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:37,373 INFO L225 Difference]: With dead ends: 5347 [2025-02-05 17:19:37,373 INFO L226 Difference]: Without dead ends: 2784 [2025-02-05 17:19:37,385 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:19:37,387 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4941 mSDsluCounter, 9049 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 13463 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:37,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 13463 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-02-05 17:19:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2761. [2025-02-05 17:19:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7955637707948244) internal successors, (4857), 2708 states have internal predecessors, (4857), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:19:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4940 transitions. [2025-02-05 17:19:37,500 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4940 transitions. Word has length 145 [2025-02-05 17:19:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4940 transitions. [2025-02-05 17:19:37,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4940 transitions. [2025-02-05 17:19:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:37,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:37,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:19:37,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash -633677862, now seen corresponding path program 1 times [2025-02-05 17:19:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675811054] [2025-02-05 17:19:37,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:37,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:37,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:37,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:37,717 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:19:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675811054] [2025-02-05 17:19:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675811054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516275579] [2025-02-05 17:19:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:37,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:37,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:37,722 INFO L87 Difference]: Start difference. First operand 2761 states and 4940 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:38,155 INFO L93 Difference]: Finished difference Result 3444 states and 6011 transitions. [2025-02-05 17:19:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:38,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:38,167 INFO L225 Difference]: With dead ends: 3444 [2025-02-05 17:19:38,167 INFO L226 Difference]: Without dead ends: 2821 [2025-02-05 17:19:38,169 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:19:38,170 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4614 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 12874 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:38,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 12874 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:19:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-02-05 17:19:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2761. [2025-02-05 17:19:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7948243992606285) internal successors, (4855), 2708 states have internal predecessors, (4855), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:19:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4938 transitions. [2025-02-05 17:19:38,252 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4938 transitions. Word has length 145 [2025-02-05 17:19:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:38,253 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4938 transitions. [2025-02-05 17:19:38,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4938 transitions. [2025-02-05 17:19:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:38,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:38,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:19:38,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:38,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -160158919, now seen corresponding path program 1 times [2025-02-05 17:19:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276841753] [2025-02-05 17:19:38,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:38,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:38,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:38,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:38,452 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:19:38,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276841753] [2025-02-05 17:19:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276841753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:38,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:38,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388690367] [2025-02-05 17:19:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:38,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:38,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:38,453 INFO L87 Difference]: Start difference. First operand 2761 states and 4938 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:39,068 INFO L93 Difference]: Finished difference Result 3779 states and 6523 transitions. [2025-02-05 17:19:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:39,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:39,082 INFO L225 Difference]: With dead ends: 3779 [2025-02-05 17:19:39,083 INFO L226 Difference]: Without dead ends: 3156 [2025-02-05 17:19:39,086 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:19:39,087 INFO L435 NwaCegarLoop]: 4607 mSDtfsCounter, 4870 mSDsluCounter, 13871 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 18478 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:39,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 18478 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2025-02-05 17:19:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3057. [2025-02-05 17:19:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2976 states have (on average 1.768481182795699) internal successors, (5263), 2980 states have internal predecessors, (5263), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:19:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 5385 transitions. [2025-02-05 17:19:39,172 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 5385 transitions. Word has length 145 [2025-02-05 17:19:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:39,173 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 5385 transitions. [2025-02-05 17:19:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 5385 transitions. [2025-02-05 17:19:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:39,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:39,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:19:39,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 270757882, now seen corresponding path program 1 times [2025-02-05 17:19:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694820951] [2025-02-05 17:19:39,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:39,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:39,406 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:19:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694820951] [2025-02-05 17:19:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694820951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770924729] [2025-02-05 17:19:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:39,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:39,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:39,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:39,409 INFO L87 Difference]: Start difference. First operand 3057 states and 5385 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:40,031 INFO L93 Difference]: Finished difference Result 4708 states and 7945 transitions. [2025-02-05 17:19:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:40,053 INFO L225 Difference]: With dead ends: 4708 [2025-02-05 17:19:40,053 INFO L226 Difference]: Without dead ends: 3789 [2025-02-05 17:19:40,059 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:19:40,061 INFO L435 NwaCegarLoop]: 4599 mSDtfsCounter, 4862 mSDsluCounter, 13849 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4879 SdHoareTripleChecker+Valid, 18448 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:40,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4879 Valid, 18448 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2025-02-05 17:19:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3681. [2025-02-05 17:19:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3548 states have (on average 1.7294250281848929) internal successors, (6136), 3556 states have internal predecessors, (6136), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:19:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6342 transitions. [2025-02-05 17:19:40,185 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6342 transitions. Word has length 145 [2025-02-05 17:19:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:40,186 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6342 transitions. [2025-02-05 17:19:40,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6342 transitions. [2025-02-05 17:19:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:40,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:40,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:40,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:19:40,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:40,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1632702213, now seen corresponding path program 1 times [2025-02-05 17:19:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286587654] [2025-02-05 17:19:40,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:40,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:40,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:40,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:40,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:40,333 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:19:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286587654] [2025-02-05 17:19:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286587654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:40,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920028163] [2025-02-05 17:19:40,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:40,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:40,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:40,335 INFO L87 Difference]: Start difference. First operand 3681 states and 6342 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:41,233 INFO L93 Difference]: Finished difference Result 6700 states and 11060 transitions. [2025-02-05 17:19:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:41,253 INFO L225 Difference]: With dead ends: 6700 [2025-02-05 17:19:41,253 INFO L226 Difference]: Without dead ends: 5157 [2025-02-05 17:19:41,257 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:19:41,259 INFO L435 NwaCegarLoop]: 4596 mSDtfsCounter, 4857 mSDsluCounter, 13840 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4874 SdHoareTripleChecker+Valid, 18436 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:41,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4874 Valid, 18436 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:19:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2025-02-05 17:19:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 5022. [2025-02-05 17:19:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 4779 states have (on average 1.6840343168026783) internal successors, (8048), 4801 states have internal predecessors, (8048), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:19:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 8446 transitions. [2025-02-05 17:19:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 8446 transitions. Word has length 145 [2025-02-05 17:19:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:41,438 INFO L471 AbstractCegarLoop]: Abstraction has 5022 states and 8446 transitions. [2025-02-05 17:19:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 8446 transitions. [2025-02-05 17:19:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:41,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:41,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:41,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:19:41,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -31536166, now seen corresponding path program 1 times [2025-02-05 17:19:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712115062] [2025-02-05 17:19:41,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:41,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:41,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:41,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:41,580 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:19:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712115062] [2025-02-05 17:19:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712115062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343502885] [2025-02-05 17:19:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:41,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:41,584 INFO L87 Difference]: Start difference. First operand 5022 states and 8446 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:42,315 INFO L93 Difference]: Finished difference Result 11037 states and 18038 transitions. [2025-02-05 17:19:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:42,352 INFO L225 Difference]: With dead ends: 11037 [2025-02-05 17:19:42,352 INFO L226 Difference]: Without dead ends: 8153 [2025-02-05 17:19:42,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:19:42,359 INFO L435 NwaCegarLoop]: 4593 mSDtfsCounter, 4852 mSDsluCounter, 13831 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4869 SdHoareTripleChecker+Valid, 18424 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:42,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4869 Valid, 18424 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2025-02-05 17:19:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7965. [2025-02-05 17:19:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6483164083377873) internal successors, (12336), 7552 states have internal predecessors, (12336), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:19:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13214 transitions. [2025-02-05 17:19:42,564 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13214 transitions. Word has length 145 [2025-02-05 17:19:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:42,564 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13214 transitions. [2025-02-05 17:19:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13214 transitions. [2025-02-05 17:19:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:42,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:42,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:42,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:19:42,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:42,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash -672622309, now seen corresponding path program 1 times [2025-02-05 17:19:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:42,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404882972] [2025-02-05 17:19:42,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:42,665 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:19:42,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404882972] [2025-02-05 17:19:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404882972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:42,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625725367] [2025-02-05 17:19:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:42,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:42,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:42,668 INFO L87 Difference]: Start difference. First operand 7965 states and 13214 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:43,135 INFO L93 Difference]: Finished difference Result 14954 states and 24808 transitions. [2025-02-05 17:19:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:43,169 INFO L225 Difference]: With dead ends: 14954 [2025-02-05 17:19:43,169 INFO L226 Difference]: Without dead ends: 9127 [2025-02-05 17:19:43,185 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:19:43,186 INFO L435 NwaCegarLoop]: 4320 mSDtfsCounter, 4606 mSDsluCounter, 8516 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4623 SdHoareTripleChecker+Valid, 12836 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:43,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4623 Valid, 12836 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-02-05 17:19:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7965. [2025-02-05 17:19:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.646044895777659) internal successors, (12319), 7552 states have internal predecessors, (12319), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:19:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13197 transitions. [2025-02-05 17:19:43,425 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13197 transitions. Word has length 145 [2025-02-05 17:19:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:43,425 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13197 transitions. [2025-02-05 17:19:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13197 transitions. [2025-02-05 17:19:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:43,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:43,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:43,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:19:43,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:43,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 553623482, now seen corresponding path program 1 times [2025-02-05 17:19:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202003891] [2025-02-05 17:19:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:43,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:43,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:43,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:43,527 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:19:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202003891] [2025-02-05 17:19:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202003891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905016488] [2025-02-05 17:19:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:43,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:43,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:43,528 INFO L87 Difference]: Start difference. First operand 7965 states and 13197 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:44,206 INFO L93 Difference]: Finished difference Result 14871 states and 24608 transitions. [2025-02-05 17:19:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:44,240 INFO L225 Difference]: With dead ends: 14871 [2025-02-05 17:19:44,240 INFO L226 Difference]: Without dead ends: 9044 [2025-02-05 17:19:44,256 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:19:44,258 INFO L435 NwaCegarLoop]: 4317 mSDtfsCounter, 4603 mSDsluCounter, 8511 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 12828 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:44,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 12828 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:19:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2025-02-05 17:19:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 7965. [2025-02-05 17:19:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6437733832175307) internal successors, (12302), 7552 states have internal predecessors, (12302), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:19:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13180 transitions. [2025-02-05 17:19:44,465 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13180 transitions. Word has length 145 [2025-02-05 17:19:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:44,466 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13180 transitions. [2025-02-05 17:19:44,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13180 transitions. [2025-02-05 17:19:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:44,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:44,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:44,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:19:44,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:44,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1840105787, now seen corresponding path program 1 times [2025-02-05 17:19:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578214038] [2025-02-05 17:19:44,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:44,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:44,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:44,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:44,700 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:19:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578214038] [2025-02-05 17:19:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578214038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827749908] [2025-02-05 17:19:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:44,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:44,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:44,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:44,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:44,708 INFO L87 Difference]: Start difference. First operand 7965 states and 13180 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:45,522 INFO L93 Difference]: Finished difference Result 20496 states and 33714 transitions. [2025-02-05 17:19:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:45,559 INFO L225 Difference]: With dead ends: 20496 [2025-02-05 17:19:45,560 INFO L226 Difference]: Without dead ends: 14669 [2025-02-05 17:19:45,571 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:19:45,573 INFO L435 NwaCegarLoop]: 4580 mSDtfsCounter, 4831 mSDsluCounter, 13794 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 18374 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:45,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4848 Valid, 18374 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14669 states. [2025-02-05 17:19:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14669 to 14418. [2025-02-05 17:19:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14418 states, 13407 states have (on average 1.6267621391810247) internal successors, (21810), 13621 states have internal predecessors, (21810), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:19:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 24032 transitions. [2025-02-05 17:19:46,052 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 24032 transitions. Word has length 145 [2025-02-05 17:19:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:46,053 INFO L471 AbstractCegarLoop]: Abstraction has 14418 states and 24032 transitions. [2025-02-05 17:19:46,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 24032 transitions. [2025-02-05 17:19:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:46,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:46,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:46,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:19:46,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:46,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -473699430, now seen corresponding path program 1 times [2025-02-05 17:19:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:46,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758857772] [2025-02-05 17:19:46,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:46,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:46,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:46,276 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:19:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758857772] [2025-02-05 17:19:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758857772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412248347] [2025-02-05 17:19:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:46,279 INFO L87 Difference]: Start difference. First operand 14418 states and 24032 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:47,458 INFO L93 Difference]: Finished difference Result 43889 states and 74349 transitions. [2025-02-05 17:19:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:47,562 INFO L225 Difference]: With dead ends: 43889 [2025-02-05 17:19:47,562 INFO L226 Difference]: Without dead ends: 31609 [2025-02-05 17:19:47,592 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:19:47,593 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 5110 mSDsluCounter, 13774 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 18349 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:47,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 18349 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:19:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31609 states. [2025-02-05 17:19:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31609 to 28929. [2025-02-05 17:19:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28929 states, 26728 states have (on average 1.6335677940736306) internal successors, (43662), 27396 states have internal predecessors, (43662), 1143 states have call successors, (1143), 390 states have call predecessors, (1143), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-02-05 17:19:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28929 states to 28929 states and 50044 transitions. [2025-02-05 17:19:48,825 INFO L78 Accepts]: Start accepts. Automaton has 28929 states and 50044 transitions. Word has length 145 [2025-02-05 17:19:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:48,825 INFO L471 AbstractCegarLoop]: Abstraction has 28929 states and 50044 transitions. [2025-02-05 17:19:48,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28929 states and 50044 transitions. [2025-02-05 17:19:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:48,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:48,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:48,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:19:48,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1656716965, now seen corresponding path program 1 times [2025-02-05 17:19:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038275152] [2025-02-05 17:19:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:48,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:48,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:49,063 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:19:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038275152] [2025-02-05 17:19:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038275152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:49,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820691470] [2025-02-05 17:19:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:49,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:49,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:49,066 INFO L87 Difference]: Start difference. First operand 28929 states and 50044 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:51,668 INFO L93 Difference]: Finished difference Result 92808 states and 167267 transitions. [2025-02-05 17:19:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:51,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:51,932 INFO L225 Difference]: With dead ends: 92808 [2025-02-05 17:19:51,933 INFO L226 Difference]: Without dead ends: 66017 [2025-02-05 17:19:52,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:19:52,004 INFO L435 NwaCegarLoop]: 4568 mSDtfsCounter, 5042 mSDsluCounter, 13755 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 18323 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:52,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 18323 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:19:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66017 states. [2025-02-05 17:19:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66017 to 61743. [2025-02-05 17:19:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.65034915708542) internal successors, (93588), 58770 states have internal predecessors, (93588), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:19:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114370 transitions. [2025-02-05 17:19:55,443 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114370 transitions. Word has length 145 [2025-02-05 17:19:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:55,444 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114370 transitions. [2025-02-05 17:19:55,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114370 transitions. [2025-02-05 17:19:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:19:55,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:55,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:55,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:19:55,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:55,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1354339164, now seen corresponding path program 1 times [2025-02-05 17:19:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958849849] [2025-02-05 17:19:55,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:19:55,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:19:55,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:55,542 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:19:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958849849] [2025-02-05 17:19:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958849849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538772209] [2025-02-05 17:19:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:55,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:55,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:55,544 INFO L87 Difference]: Start difference. First operand 61743 states and 114370 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:57,939 INFO L93 Difference]: Finished difference Result 138860 states and 269854 transitions. [2025-02-05 17:19:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:57,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:19:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:58,270 INFO L225 Difference]: With dead ends: 138860 [2025-02-05 17:19:58,271 INFO L226 Difference]: Without dead ends: 79255 [2025-02-05 17:19:58,412 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:19:58,412 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4594 mSDsluCounter, 8488 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 12794 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:58,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 12794 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:19:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79255 states. [2025-02-05 17:20:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79255 to 61743. [2025-02-05 17:20:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.6480743457713198) internal successors, (93459), 58770 states have internal predecessors, (93459), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:20:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114241 transitions. [2025-02-05 17:20:02,125 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114241 transitions. Word has length 145 [2025-02-05 17:20:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:02,126 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114241 transitions. [2025-02-05 17:20:02,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114241 transitions. [2025-02-05 17:20:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:20:02,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:02,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:20:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:20:02,146 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1590017339, now seen corresponding path program 1 times [2025-02-05 17:20:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342569403] [2025-02-05 17:20:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:02,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:20:02,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:20:02,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:02,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:02,230 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:20:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342569403] [2025-02-05 17:20:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342569403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:02,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:02,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:20:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760897808] [2025-02-05 17:20:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:02,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:20:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:20:02,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:20:02,232 INFO L87 Difference]: Start difference. First operand 61743 states and 114241 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:05,349 INFO L93 Difference]: Finished difference Result 136671 states and 265218 transitions. [2025-02-05 17:20:05,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:20:05,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:20:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:05,759 INFO L225 Difference]: With dead ends: 136671 [2025-02-05 17:20:05,759 INFO L226 Difference]: Without dead ends: 77066 [2025-02-05 17:20:05,948 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:20:05,949 INFO L435 NwaCegarLoop]: 4303 mSDtfsCounter, 4591 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 12786 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 12786 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:20:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77066 states. [2025-02-05 17:20:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77066 to 61743. [2025-02-05 17:20:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.6457995344572194) internal successors, (93330), 58770 states have internal predecessors, (93330), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:20:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114112 transitions. [2025-02-05 17:20:11,104 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114112 transitions. Word has length 145 [2025-02-05 17:20:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:20:11,104 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114112 transitions. [2025-02-05 17:20:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114112 transitions. [2025-02-05 17:20:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:20:11,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:20:11,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:20:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:20:11,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:20:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:20:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash 766335868, now seen corresponding path program 1 times [2025-02-05 17:20:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:20:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996464669] [2025-02-05 17:20:11,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:20:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:20:11,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:20:11,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:20:11,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:20:11,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:20:11,206 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:20:11,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:20:11,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996464669] [2025-02-05 17:20:11,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996464669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:20:11,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:20:11,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:20:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928833960] [2025-02-05 17:20:11,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:20:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:20:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:20:11,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:20:11,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:20:11,208 INFO L87 Difference]: Start difference. First operand 61743 states and 114112 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:20:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:20:15,687 INFO L93 Difference]: Finished difference Result 198762 states and 394537 transitions. [2025-02-05 17:20:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:20:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:20:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:20:16,750 INFO L225 Difference]: With dead ends: 198762 [2025-02-05 17:20:16,750 INFO L226 Difference]: Without dead ends: 139157 [2025-02-05 17:20:16,869 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:20:16,869 INFO L435 NwaCegarLoop]: 4555 mSDtfsCounter, 4931 mSDsluCounter, 13718 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 18273 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:20:16,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 18273 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:20:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139157 states.