./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.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_label44+token_ring.08.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 a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:11:35,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:11:35,840 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:11:35,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:11:35,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:11:35,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:11:35,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:11:35,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:11:35,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:11:35,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:11:35,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:11:35,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:11:35,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:11:35,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:11:35,869 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:11:35,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:11:35,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:11:35,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:11:35,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:11:35,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:11:35,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:11:35,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:11:35,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:11:35,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:11:35,872 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 -> a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 [2025-02-05 17:11:36,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:11:36,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:11:36,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:11:36,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:11:36,201 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:11:36,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2025-02-05 17:11:37,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d56f6b31/3cbe1950c03e4af3902c2bc6c2bc672a/FLAG1adc6c204 [2025-02-05 17:11:38,281 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:11:38,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2025-02-05 17:11:38,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d56f6b31/3cbe1950c03e4af3902c2bc6c2bc672a/FLAG1adc6c204 [2025-02-05 17:11:38,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d56f6b31/3cbe1950c03e4af3902c2bc6c2bc672a [2025-02-05 17:11:38,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:11:38,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:11:38,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:11:38,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:11:38,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:11:38,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:11:38" (1/1) ... [2025-02-05 17:11:38,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ef64e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:38, skipping insertion in model container [2025-02-05 17:11:38,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:11:38" (1/1) ... [2025-02-05 17:11:38,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:11:39,874 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_label44+token_ring.08.cil-1.c[377340,377353] [2025-02-05 17:11:39,913 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_label44+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:11:40,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:11:40,199 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:11:40,830 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_label44+token_ring.08.cil-1.c[377340,377353] [2025-02-05 17:11:40,836 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_label44+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:11:40,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:11:40,909 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:11:40,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40 WrapperNode [2025-02-05 17:11:40,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:11:40,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:11:40,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:11:40,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:11:40,917 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:11:40" (1/1) ... [2025-02-05 17:11:40,990 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:11:40" (1/1) ... [2025-02-05 17:11:41,371 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-02-05 17:11:41,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:11:41,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:11:41,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:11:41,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:11:41,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,688 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:11:41,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:11:41,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:11:41,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:11:41,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:11:41,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (1/1) ... [2025-02-05 17:11:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:11:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:11:42,009 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:11:42,014 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:11:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:11:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:11:42,040 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:11:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:11:42,040 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:11:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:11:42,040 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:11:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:11:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:11:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:11:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:11:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:11:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:11:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:11:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:11:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:11:42,167 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:11:42,169 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:11:50,345 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:11:50,345 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:11:50,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:11:50,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:11:50,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:11:50,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:11:50,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:11:50,712 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-02-05 17:11:50,713 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:11:50,789 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:11:50,789 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:11:50,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:11:50 BoogieIcfgContainer [2025-02-05 17:11:50,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:11:50,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:11:50,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:11:50,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:11:50,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:11:38" (1/3) ... [2025-02-05 17:11:50,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60209c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:11:50, skipping insertion in model container [2025-02-05 17:11:50,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:40" (2/3) ... [2025-02-05 17:11:50,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60209c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:11:50, skipping insertion in model container [2025-02-05 17:11:50,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:11:50" (3/3) ... [2025-02-05 17:11:50,802 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.08.cil-1.c [2025-02-05 17:11:50,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:11:50,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.08.cil-1.c that has 7 procedures, 2483 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-02-05 17:11:50,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:11:50,960 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;@1f6fb396, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:11:50,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:11:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:11:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:50,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:50,999 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] [2025-02-05 17:11:51,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:51,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash 840339491, now seen corresponding path program 1 times [2025-02-05 17:11:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:51,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107546458] [2025-02-05 17:11:51,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:51,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:51,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:51,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:51,670 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:11:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107546458] [2025-02-05 17:11:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107546458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:51,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351434274] [2025-02-05 17:11:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:51,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:51,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:51,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:51,709 INFO L87 Difference]: Start difference. First operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:11:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:52,559 INFO L93 Difference]: Finished difference Result 5264 states and 9573 transitions. [2025-02-05 17:11:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:11:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:52,602 INFO L225 Difference]: With dead ends: 5264 [2025-02-05 17:11:52,602 INFO L226 Difference]: Without dead ends: 2727 [2025-02-05 17:11:52,619 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:11:52,624 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4854 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 13339 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:52,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 13339 Invalid, 516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-02-05 17:11:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2706. [2025-02-05 17:11:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7997737556561086) internal successors, (4773), 2655 states have internal predecessors, (4773), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:11:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4852 transitions. [2025-02-05 17:11:52,814 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4852 transitions. Word has length 134 [2025-02-05 17:11:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4852 transitions. [2025-02-05 17:11:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:11:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4852 transitions. [2025-02-05 17:11:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:52,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:52,824 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] [2025-02-05 17:11:52,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:11:52,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -12912283, now seen corresponding path program 1 times [2025-02-05 17:11:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:52,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585065077] [2025-02-05 17:11:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:52,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:52,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:52,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:53,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:11:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585065077] [2025-02-05 17:11:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585065077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166984558] [2025-02-05 17:11:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:53,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:53,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:53,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:53,212 INFO L87 Difference]: Start difference. First operand 2706 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:11:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:53,667 INFO L93 Difference]: Finished difference Result 3329 states and 5825 transitions. [2025-02-05 17:11:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:53,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:53,683 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 17:11:53,683 INFO L226 Difference]: Without dead ends: 2760 [2025-02-05 17:11:53,687 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:11:53,688 INFO L435 NwaCegarLoop]: 4299 mSDtfsCounter, 4553 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12782 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:53,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12782 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-02-05 17:11:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2706. [2025-02-05 17:11:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7990196078431373) internal successors, (4771), 2655 states have internal predecessors, (4771), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:11:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4850 transitions. [2025-02-05 17:11:53,789 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4850 transitions. Word has length 134 [2025-02-05 17:11:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:53,790 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4850 transitions. [2025-02-05 17:11:53,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:11:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4850 transitions. [2025-02-05 17:11:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:53,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:53,793 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] [2025-02-05 17:11:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:11:53,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452796, now seen corresponding path program 1 times [2025-02-05 17:11:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092352012] [2025-02-05 17:11:53,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:53,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:53,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:53,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:54,083 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:11:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092352012] [2025-02-05 17:11:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092352012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421226496] [2025-02-05 17:11:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:54,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:54,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:54,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:54,086 INFO L87 Difference]: Start difference. First operand 2706 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:54,922 INFO L93 Difference]: Finished difference Result 3634 states and 6288 transitions. [2025-02-05 17:11:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:54,939 INFO L225 Difference]: With dead ends: 3634 [2025-02-05 17:11:54,940 INFO L226 Difference]: Without dead ends: 3065 [2025-02-05 17:11:54,944 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:11:54,945 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 4781 mSDsluCounter, 13683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18231 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:54,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18231 Invalid, 846 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-02-05 17:11:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2976. [2025-02-05 17:11:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2898 states have (on average 1.7736369910282954) internal successors, (5140), 2902 states have internal predecessors, (5140), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-02-05 17:11:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5256 transitions. [2025-02-05 17:11:55,065 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5256 transitions. Word has length 134 [2025-02-05 17:11:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:55,066 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5256 transitions. [2025-02-05 17:11:55,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5256 transitions. [2025-02-05 17:11:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:55,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:55,070 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] [2025-02-05 17:11:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:11:55,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1851603333, now seen corresponding path program 1 times [2025-02-05 17:11:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72125377] [2025-02-05 17:11:55,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:55,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:55,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:55,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:55,293 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:11:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72125377] [2025-02-05 17:11:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72125377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201990372] [2025-02-05 17:11:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:55,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:55,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:55,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:55,296 INFO L87 Difference]: Start difference. First operand 2976 states and 5256 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:56,144 INFO L93 Difference]: Finished difference Result 4487 states and 7591 transitions. [2025-02-05 17:11:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:56,172 INFO L225 Difference]: With dead ends: 4487 [2025-02-05 17:11:56,172 INFO L226 Difference]: Without dead ends: 3648 [2025-02-05 17:11:56,178 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:11:56,180 INFO L435 NwaCegarLoop]: 4544 mSDtfsCounter, 4776 mSDsluCounter, 13671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4792 SdHoareTripleChecker+Valid, 18215 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:56,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4792 Valid, 18215 Invalid, 846 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-02-05 17:11:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3547. [2025-02-05 17:11:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3419 states have (on average 1.7353027200935947) internal successors, (5933), 3427 states have internal predecessors, (5933), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 17:11:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6129 transitions. [2025-02-05 17:11:56,351 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6129 transitions. Word has length 134 [2025-02-05 17:11:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:56,352 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6129 transitions. [2025-02-05 17:11:56,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6129 transitions. [2025-02-05 17:11:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:56,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:56,355 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] [2025-02-05 17:11:56,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:11:56,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2087281508, now seen corresponding path program 1 times [2025-02-05 17:11:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949347181] [2025-02-05 17:11:56,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:56,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:56,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:56,562 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:11:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949347181] [2025-02-05 17:11:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949347181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918127966] [2025-02-05 17:11:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:56,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:56,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:56,565 INFO L87 Difference]: Start difference. First operand 3547 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:57,351 INFO L93 Difference]: Finished difference Result 6312 states and 10438 transitions. [2025-02-05 17:11:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:57,378 INFO L225 Difference]: With dead ends: 6312 [2025-02-05 17:11:57,379 INFO L226 Difference]: Without dead ends: 4902 [2025-02-05 17:11:57,384 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:11:57,386 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4797 mSDsluCounter, 13155 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 17486 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:57,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 17486 Invalid, 715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:11:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-02-05 17:11:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4776. [2025-02-05 17:11:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4542 states have (on average 1.6893439013650375) internal successors, (7673), 4564 states have internal predecessors, (7673), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 17:11:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8053 transitions. [2025-02-05 17:11:57,583 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8053 transitions. Word has length 134 [2025-02-05 17:11:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:57,584 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8053 transitions. [2025-02-05 17:11:57,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8053 transitions. [2025-02-05 17:11:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:57,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:57,588 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] [2025-02-05 17:11:57,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:11:57,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1263600037, now seen corresponding path program 1 times [2025-02-05 17:11:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919212492] [2025-02-05 17:11:57,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:57,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:11:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:57,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919212492] [2025-02-05 17:11:57,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919212492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:57,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303357330] [2025-02-05 17:11:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:57,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:57,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:57,730 INFO L87 Difference]: Start difference. First operand 4776 states and 8053 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:58,539 INFO L93 Difference]: Finished difference Result 10291 states and 16832 transitions. [2025-02-05 17:11:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:11:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:58,590 INFO L225 Difference]: With dead ends: 10291 [2025-02-05 17:11:58,590 INFO L226 Difference]: Without dead ends: 7652 [2025-02-05 17:11:58,603 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:11:58,604 INFO L435 NwaCegarLoop]: 4538 mSDtfsCounter, 4766 mSDsluCounter, 13653 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 18191 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:58,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 18191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-02-05 17:11:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7477. [2025-02-05 17:11:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7013 states have (on average 1.6513617567374874) internal successors, (11581), 7081 states have internal predecessors, (11581), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 17:11:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 12425 transitions. [2025-02-05 17:11:58,870 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 12425 transitions. Word has length 134 [2025-02-05 17:11:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 7477 states and 12425 transitions. [2025-02-05 17:11:58,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:11:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 12425 transitions. [2025-02-05 17:11:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:11:58,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:58,876 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] [2025-02-05 17:11:58,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:11:58,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1949558972, now seen corresponding path program 1 times [2025-02-05 17:11:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239559808] [2025-02-05 17:11:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:11:58,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:11:58,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:58,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:59,030 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:11:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239559808] [2025-02-05 17:11:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239559808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:59,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:59,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105331966] [2025-02-05 17:11:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:59,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:59,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:59,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:59,032 INFO L87 Difference]: Start difference. First operand 7477 states and 12425 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:00,006 INFO L93 Difference]: Finished difference Result 19162 states and 31698 transitions. [2025-02-05 17:12:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:00,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:00,080 INFO L225 Difference]: With dead ends: 19162 [2025-02-05 17:12:00,080 INFO L226 Difference]: Without dead ends: 13822 [2025-02-05 17:12:00,105 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:12:00,107 INFO L435 NwaCegarLoop]: 4535 mSDtfsCounter, 4761 mSDsluCounter, 13644 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18179 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:00,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18179 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:12:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-02-05 17:12:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13554. [2025-02-05 17:12:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6362118320610688) internal successors, (20577), 12790 states have internal predecessors, (20577), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:12:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22733 transitions. [2025-02-05 17:12:00,623 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22733 transitions. Word has length 134 [2025-02-05 17:12:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:00,624 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22733 transitions. [2025-02-05 17:12:00,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22733 transitions. [2025-02-05 17:12:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:00,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:00,633 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] [2025-02-05 17:12:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:12:00,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1826116037, now seen corresponding path program 1 times [2025-02-05 17:12:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923564104] [2025-02-05 17:12:00,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:00,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:00,754 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:12:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923564104] [2025-02-05 17:12:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923564104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:00,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727047044] [2025-02-05 17:12:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:00,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:00,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:00,758 INFO L87 Difference]: Start difference. First operand 13554 states and 22733 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:01,471 INFO L93 Difference]: Finished difference Result 27911 states and 47718 transitions. [2025-02-05 17:12:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:01,555 INFO L225 Difference]: With dead ends: 27911 [2025-02-05 17:12:01,555 INFO L226 Difference]: Without dead ends: 16494 [2025-02-05 17:12:01,597 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:12:01,600 INFO L435 NwaCegarLoop]: 4286 mSDtfsCounter, 4545 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 12744 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:01,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 12744 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-02-05 17:12:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 13554. [2025-02-05 17:12:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.633587786259542) internal successors, (20544), 12790 states have internal predecessors, (20544), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:12:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22700 transitions. [2025-02-05 17:12:02,349 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22700 transitions. Word has length 134 [2025-02-05 17:12:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:02,350 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22700 transitions. [2025-02-05 17:12:02,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22700 transitions. [2025-02-05 17:12:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:02,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:02,362 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] [2025-02-05 17:12:02,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:12:02,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:02,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 839533348, now seen corresponding path program 1 times [2025-02-05 17:12:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:02,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922121289] [2025-02-05 17:12:02,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:02,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:02,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:02,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:02,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:02,504 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:12:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922121289] [2025-02-05 17:12:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922121289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169570569] [2025-02-05 17:12:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:02,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:02,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:02,506 INFO L87 Difference]: Start difference. First operand 13554 states and 22700 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:03,211 INFO L93 Difference]: Finished difference Result 27666 states and 47162 transitions. [2025-02-05 17:12:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:03,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:03,291 INFO L225 Difference]: With dead ends: 27666 [2025-02-05 17:12:03,291 INFO L226 Difference]: Without dead ends: 16249 [2025-02-05 17:12:03,329 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:12:03,329 INFO L435 NwaCegarLoop]: 4283 mSDtfsCounter, 4542 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:03,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12736 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-02-05 17:12:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 13554. [2025-02-05 17:12:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6309637404580153) internal successors, (20511), 12790 states have internal predecessors, (20511), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:12:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22667 transitions. [2025-02-05 17:12:04,028 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22667 transitions. Word has length 134 [2025-02-05 17:12:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:04,029 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22667 transitions. [2025-02-05 17:12:04,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22667 transitions. [2025-02-05 17:12:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:04,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:04,038 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] [2025-02-05 17:12:04,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:12:04,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:04,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1916086757, now seen corresponding path program 1 times [2025-02-05 17:12:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:04,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888949437] [2025-02-05 17:12:04,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:04,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:04,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:04,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:04,187 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:12:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888949437] [2025-02-05 17:12:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888949437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776173674] [2025-02-05 17:12:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:04,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:04,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:04,189 INFO L87 Difference]: Start difference. First operand 13554 states and 22667 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:05,562 INFO L93 Difference]: Finished difference Result 40825 states and 69395 transitions. [2025-02-05 17:12:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:05,681 INFO L225 Difference]: With dead ends: 40825 [2025-02-05 17:12:05,682 INFO L226 Difference]: Without dead ends: 29408 [2025-02-05 17:12:05,721 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:12:05,722 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4994 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18116 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:05,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18116 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:12:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2025-02-05 17:12:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 26989. [2025-02-05 17:12:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.634691988894701) internal successors, (40627), 25521 states have internal predecessors, (40627), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:12:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46879 transitions. [2025-02-05 17:12:06,816 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46879 transitions. Word has length 134 [2025-02-05 17:12:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:06,816 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46879 transitions. [2025-02-05 17:12:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46879 transitions. [2025-02-05 17:12:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:06,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:06,829 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] [2025-02-05 17:12:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:12:06,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -543037692, now seen corresponding path program 1 times [2025-02-05 17:12:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815962991] [2025-02-05 17:12:06,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:06,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:06,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:06,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:06,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:06,936 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:12:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815962991] [2025-02-05 17:12:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815962991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:06,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804800082] [2025-02-05 17:12:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:06,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:06,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:06,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:06,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:06,938 INFO L87 Difference]: Start difference. First operand 26989 states and 46879 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:08,616 INFO L93 Difference]: Finished difference Result 58420 states and 104966 transitions. [2025-02-05 17:12:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:08,785 INFO L225 Difference]: With dead ends: 58420 [2025-02-05 17:12:08,785 INFO L226 Difference]: Without dead ends: 33568 [2025-02-05 17:12:08,884 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:12:08,885 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4536 mSDsluCounter, 8442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:08,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12720 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33568 states. [2025-02-05 17:12:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33568 to 26989. [2025-02-05 17:12:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.632076610469561) internal successors, (40562), 25521 states have internal predecessors, (40562), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:12:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46814 transitions. [2025-02-05 17:12:10,647 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46814 transitions. Word has length 134 [2025-02-05 17:12:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46814 transitions. [2025-02-05 17:12:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46814 transitions. [2025-02-05 17:12:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:10,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:10,659 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] [2025-02-05 17:12:10,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:12:10,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -483816955, now seen corresponding path program 1 times [2025-02-05 17:12:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799708200] [2025-02-05 17:12:10,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:10,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:10,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:10,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:10,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:10,781 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:12:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:10,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799708200] [2025-02-05 17:12:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799708200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:10,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:10,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074984794] [2025-02-05 17:12:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:10,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:10,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:10,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:10,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:10,785 INFO L87 Difference]: Start difference. First operand 26989 states and 46814 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:13,235 INFO L93 Difference]: Finished difference Result 85774 states and 155330 transitions. [2025-02-05 17:12:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:13,575 INFO L225 Difference]: With dead ends: 85774 [2025-02-05 17:12:13,576 INFO L226 Difference]: Without dead ends: 60922 [2025-02-05 17:12:13,681 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:12:13,683 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4921 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4946 SdHoareTripleChecker+Valid, 18085 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:13,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4946 Valid, 18085 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:12:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60922 states. [2025-02-05 17:12:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60922 to 57165. [2025-02-05 17:12:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6452668439885954) internal successors, (85980), 54321 states have internal predecessors, (85980), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:12:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106504 transitions. [2025-02-05 17:12:17,053 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106504 transitions. Word has length 134 [2025-02-05 17:12:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106504 transitions. [2025-02-05 17:12:17,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:12:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106504 transitions. [2025-02-05 17:12:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:17,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:17,074 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] [2025-02-05 17:12:17,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:12:17,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:17,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash 210830052, now seen corresponding path program 1 times [2025-02-05 17:12:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716570671] [2025-02-05 17:12:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:17,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:17,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:17,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:17,170 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:12:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716570671] [2025-02-05 17:12:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716570671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892373225] [2025-02-05 17:12:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:17,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:17,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:17,173 INFO L87 Difference]: Start difference. First operand 57165 states and 106504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:21,009 INFO L93 Difference]: Finished difference Result 127516 states and 249746 transitions. [2025-02-05 17:12:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:21,272 INFO L225 Difference]: With dead ends: 127516 [2025-02-05 17:12:21,272 INFO L226 Difference]: Without dead ends: 72488 [2025-02-05 17:12:21,407 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:12:21,407 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4543 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4559 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:21,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4559 Valid, 12680 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states. [2025-02-05 17:12:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72488 to 57165. [2025-02-05 17:12:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6427983696588147) internal successors, (85851), 54321 states have internal predecessors, (85851), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:12:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106375 transitions. [2025-02-05 17:12:25,963 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106375 transitions. Word has length 134 [2025-02-05 17:12:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:25,964 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106375 transitions. [2025-02-05 17:12:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106375 transitions. [2025-02-05 17:12:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:12:25,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:25,983 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] [2025-02-05 17:12:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:12:25,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1341616677, now seen corresponding path program 1 times [2025-02-05 17:12:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661647890] [2025-02-05 17:12:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:25,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:12:25,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:12:25,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:25,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:26,065 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:12:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661647890] [2025-02-05 17:12:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661647890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:26,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135578811] [2025-02-05 17:12:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:26,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:26,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:26,068 INFO L87 Difference]: Start difference. First operand 57165 states and 106375 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:12:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:28,737 INFO L93 Difference]: Finished difference Result 125327 states and 245110 transitions. [2025-02-05 17:12:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:12:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:29,238 INFO L225 Difference]: With dead ends: 125327 [2025-02-05 17:12:29,238 INFO L226 Difference]: Without dead ends: 70299 [2025-02-05 17:12:29,379 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:12:29,379 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4529 mSDsluCounter, 8428 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:29,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 12698 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70299 states.