./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:46:08,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:46:08,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:46:08,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:46:08,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:46:08,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:46:08,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:46:08,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:46:08,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:46:08,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:46:08,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:46:08,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:46:08,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:46:08,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:46:08,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:46:08,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:46:08,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:08,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:46:08,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf [2025-03-03 15:46:08,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:46:08,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:46:08,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:46:08,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:46:08,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:46:08,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2025-03-03 15:46:09,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72258e7e5/7f414ba37b8d4684bb97b8c09df996ee/FLAG007953261 [2025-03-03 15:46:10,191 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:46:10,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2025-03-03 15:46:10,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72258e7e5/7f414ba37b8d4684bb97b8c09df996ee/FLAG007953261 [2025-03-03 15:46:10,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72258e7e5/7f414ba37b8d4684bb97b8c09df996ee [2025-03-03 15:46:10,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:46:10,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:46:10,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:10,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:46:10,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:46:10,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:10" (1/1) ... [2025-03-03 15:46:10,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d4dc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:10, skipping insertion in model container [2025-03-03 15:46:10,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:10" (1/1) ... [2025-03-03 15:46:10,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:46:11,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[377612,377625] [2025-03-03 15:46:11,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:46:12,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:12,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:46:12,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[377612,377625] [2025-03-03 15:46:12,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:46:12,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:12,790 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:46:12,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12 WrapperNode [2025-03-03 15:46:12,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:12,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:12,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:46:12,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:46:12,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:12,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,118 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-03-03 15:46:13,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:13,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:46:13,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:46:13,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:46:13,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,294 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:46:13,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:46:13,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:46:13,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:46:13,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:46:13,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (1/1) ... [2025-03-03 15:46:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:13,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:13,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:46:13,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:46:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:46:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:46:13,747 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:46:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:46:13,747 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:46:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:46:13,748 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:46:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:46:13,748 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:46:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:46:13,748 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:46:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:46:13,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:46:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:46:13,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:46:13,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:46:13,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:46:13,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:46:19,874 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:46:19,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:46:19,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:46:19,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:46:19,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:46:19,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:46:19,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:46:20,116 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-03-03 15:46:20,117 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:46:20,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:46:20,182 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:46:20,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:20 BoogieIcfgContainer [2025-03-03 15:46:20,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:46:20,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:46:20,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:46:20,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:46:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:46:10" (1/3) ... [2025-03-03 15:46:20,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d53d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:20, skipping insertion in model container [2025-03-03 15:46:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:12" (2/3) ... [2025-03-03 15:46:20,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d53d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:20, skipping insertion in model container [2025-03-03 15:46:20,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:20" (3/3) ... [2025-03-03 15:46:20,189 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.05.cil-1.c [2025-03-03 15:46:20,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:46:20,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.05.cil-1.c that has 7 procedures, 2402 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 15:46:20,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:46:20,318 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;@253e7f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:46:20,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:46:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 15:46:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:20,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:20,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:20,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1126425006, now seen corresponding path program 1 times [2025-03-03 15:46:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871153732] [2025-03-03 15:46:20,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:20,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:20,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:20,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871153732] [2025-03-03 15:46:20,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871153732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:20,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:20,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178376937] [2025-03-03 15:46:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:20,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:20,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:20,787 INFO L87 Difference]: Start difference. First operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:21,258 INFO L93 Difference]: Finished difference Result 5015 states and 9165 transitions. [2025-03-03 15:46:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:46:21,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:21,291 INFO L225 Difference]: With dead ends: 5015 [2025-03-03 15:46:21,291 INFO L226 Difference]: Without dead ends: 2556 [2025-03-03 15:46:21,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:21,301 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4593 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 12967 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:21,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 12967 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-03-03 15:46:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2541. [2025-03-03 15:46:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8134777376654634) internal successors, (4521), 2496 states have internal predecessors, (4521), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:46:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4588 transitions. [2025-03-03 15:46:21,537 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4588 transitions. Word has length 101 [2025-03-03 15:46:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:21,537 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4588 transitions. [2025-03-03 15:46:21,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4588 transitions. [2025-03-03 15:46:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:21,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:21,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:21,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:46:21,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:21,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 267982704, now seen corresponding path program 1 times [2025-03-03 15:46:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247573677] [2025-03-03 15:46:21,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:21,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:21,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:21,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247573677] [2025-03-03 15:46:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247573677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:21,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:21,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744626994] [2025-03-03 15:46:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:21,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:21,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:21,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:21,710 INFO L87 Difference]: Start difference. First operand 2541 states and 4588 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:21,962 INFO L93 Difference]: Finished difference Result 2984 states and 5267 transitions. [2025-03-03 15:46:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:21,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:21,974 INFO L225 Difference]: With dead ends: 2984 [2025-03-03 15:46:21,974 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 15:46:21,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:21,978 INFO L435 NwaCegarLoop]: 4197 mSDtfsCounter, 4370 mSDsluCounter, 8309 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:21,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 12506 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:46:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 15:46:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2541. [2025-03-03 15:46:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8126754913758525) internal successors, (4519), 2496 states have internal predecessors, (4519), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:46:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4586 transitions. [2025-03-03 15:46:22,048 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4586 transitions. Word has length 101 [2025-03-03 15:46:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:22,049 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4586 transitions. [2025-03-03 15:46:22,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4586 transitions. [2025-03-03 15:46:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:22,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:22,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:22,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:46:22,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1475900879, now seen corresponding path program 1 times [2025-03-03 15:46:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026044971] [2025-03-03 15:46:22,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:22,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:22,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:22,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026044971] [2025-03-03 15:46:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026044971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:22,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001799763] [2025-03-03 15:46:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:22,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:22,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:22,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:22,209 INFO L87 Difference]: Start difference. First operand 2541 states and 4586 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:22,695 INFO L93 Difference]: Finished difference Result 3199 states and 5583 transitions. [2025-03-03 15:46:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:22,708 INFO L225 Difference]: With dead ends: 3199 [2025-03-03 15:46:22,709 INFO L226 Difference]: Without dead ends: 2792 [2025-03-03 15:46:22,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:22,713 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4514 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 17490 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:22,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4527 Valid, 17490 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:46:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2025-03-03 15:46:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2733. [2025-03-03 15:46:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2733 states, 2664 states have (on average 1.7909159159159158) internal successors, (4771), 2668 states have internal predecessors, (4771), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-03 15:46:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4869 transitions. [2025-03-03 15:46:22,788 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4869 transitions. Word has length 101 [2025-03-03 15:46:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:22,788 INFO L471 AbstractCegarLoop]: Abstraction has 2733 states and 4869 transitions. [2025-03-03 15:46:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4869 transitions. [2025-03-03 15:46:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:22,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:22,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:46:22,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash -9154672, now seen corresponding path program 1 times [2025-03-03 15:46:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305392702] [2025-03-03 15:46:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:22,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305392702] [2025-03-03 15:46:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305392702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059545381] [2025-03-03 15:46:23,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:23,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:23,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:23,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:23,047 INFO L87 Difference]: Start difference. First operand 2733 states and 4869 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:23,675 INFO L93 Difference]: Finished difference Result 3800 states and 6481 transitions. [2025-03-03 15:46:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:23,687 INFO L225 Difference]: With dead ends: 3800 [2025-03-03 15:46:23,687 INFO L226 Difference]: Without dead ends: 3201 [2025-03-03 15:46:23,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:23,692 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4509 mSDsluCounter, 13107 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 17474 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:23,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 17474 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:46:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-03-03 15:46:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3136. [2025-03-03 15:46:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3023 states have (on average 1.7552100562355277) internal successors, (5306), 3031 states have internal predecessors, (5306), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-03 15:46:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5472 transitions. [2025-03-03 15:46:23,785 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5472 transitions. Word has length 101 [2025-03-03 15:46:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5472 transitions. [2025-03-03 15:46:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5472 transitions. [2025-03-03 15:46:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:23,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:23,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:46:23,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash 774224303, now seen corresponding path program 1 times [2025-03-03 15:46:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382442753] [2025-03-03 15:46:23,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:23,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:23,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:23,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:23,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:23,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382442753] [2025-03-03 15:46:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382442753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:23,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789630749] [2025-03-03 15:46:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:23,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:23,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:23,911 INFO L87 Difference]: Start difference. First operand 3136 states and 5472 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:24,342 INFO L93 Difference]: Finished difference Result 5073 states and 8422 transitions. [2025-03-03 15:46:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:24,359 INFO L225 Difference]: With dead ends: 5073 [2025-03-03 15:46:24,359 INFO L226 Difference]: Without dead ends: 4071 [2025-03-03 15:46:24,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:24,364 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4504 mSDsluCounter, 13098 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 17462 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:24,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 17462 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-03-03 15:46:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3993. [2025-03-03 15:46:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3786 states have (on average 1.705758055995774) internal successors, (6458), 3808 states have internal predecessors, (6458), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-03 15:46:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 6784 transitions. [2025-03-03 15:46:24,517 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 6784 transitions. Word has length 101 [2025-03-03 15:46:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 6784 transitions. [2025-03-03 15:46:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 6784 transitions. [2025-03-03 15:46:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:24,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:24,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:24,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:46:24,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 245305264, now seen corresponding path program 1 times [2025-03-03 15:46:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257341206] [2025-03-03 15:46:24,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:24,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:24,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:24,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:24,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257341206] [2025-03-03 15:46:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257341206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997262535] [2025-03-03 15:46:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:24,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:24,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:24,620 INFO L87 Difference]: Start difference. First operand 3993 states and 6784 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:25,113 INFO L93 Difference]: Finished difference Result 8086 states and 13121 transitions. [2025-03-03 15:46:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:25,137 INFO L225 Difference]: With dead ends: 8086 [2025-03-03 15:46:25,137 INFO L226 Difference]: Without dead ends: 6227 [2025-03-03 15:46:25,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:25,145 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4660 mSDsluCounter, 13068 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 17423 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4679 Valid, 17423 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2025-03-03 15:46:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5791. [2025-03-03 15:46:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6531748978834013) internal successors, (8904), 5454 states have internal predecessors, (8904), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:46:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9630 transitions. [2025-03-03 15:46:25,306 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9630 transitions. Word has length 101 [2025-03-03 15:46:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:25,306 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9630 transitions. [2025-03-03 15:46:25,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9630 transitions. [2025-03-03 15:46:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:25,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:25,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:46:25,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 365425137, now seen corresponding path program 1 times [2025-03-03 15:46:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113155842] [2025-03-03 15:46:25,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:25,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:25,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113155842] [2025-03-03 15:46:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113155842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988164083] [2025-03-03 15:46:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:25,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:25,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:25,404 INFO L87 Difference]: Start difference. First operand 5791 states and 9630 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:25,670 INFO L93 Difference]: Finished difference Result 9946 states and 16320 transitions. [2025-03-03 15:46:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:25,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:25,693 INFO L225 Difference]: With dead ends: 9946 [2025-03-03 15:46:25,693 INFO L226 Difference]: Without dead ends: 6289 [2025-03-03 15:46:25,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:25,703 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4360 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 12466 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:25,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4373 Valid, 12466 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:46:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2025-03-03 15:46:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5791. [2025-03-03 15:46:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6500185666542888) internal successors, (8887), 5454 states have internal predecessors, (8887), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:46:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9613 transitions. [2025-03-03 15:46:25,867 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9613 transitions. Word has length 101 [2025-03-03 15:46:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:25,867 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9613 transitions. [2025-03-03 15:46:25,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9613 transitions. [2025-03-03 15:46:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:25,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:25,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:25,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:46:25,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash 784941968, now seen corresponding path program 1 times [2025-03-03 15:46:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119681063] [2025-03-03 15:46:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:25,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:25,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:25,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119681063] [2025-03-03 15:46:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119681063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349256123] [2025-03-03 15:46:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:25,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:25,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:25,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:25,967 INFO L87 Difference]: Start difference. First operand 5791 states and 9613 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:26,775 INFO L93 Difference]: Finished difference Result 13810 states and 22442 transitions. [2025-03-03 15:46:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:26,813 INFO L225 Difference]: With dead ends: 13810 [2025-03-03 15:46:26,813 INFO L226 Difference]: Without dead ends: 10153 [2025-03-03 15:46:26,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:26,829 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4587 mSDsluCounter, 13045 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 17392 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:26,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 17392 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:46:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-03-03 15:46:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9579. [2025-03-03 15:46:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6043289051763627) internal successors, (14009), 8946 states have internal predecessors, (14009), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:46:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15903 transitions. [2025-03-03 15:46:27,156 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15903 transitions. Word has length 101 [2025-03-03 15:46:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:27,156 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15903 transitions. [2025-03-03 15:46:27,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15903 transitions. [2025-03-03 15:46:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:27,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:27,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:27,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:46:27,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:27,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 798474769, now seen corresponding path program 1 times [2025-03-03 15:46:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:27,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978208865] [2025-03-03 15:46:27,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:27,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:27,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:27,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978208865] [2025-03-03 15:46:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978208865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:27,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:27,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748954840] [2025-03-03 15:46:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:27,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:27,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:27,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:27,231 INFO L87 Difference]: Start difference. First operand 9579 states and 15903 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:27,641 INFO L93 Difference]: Finished difference Result 18004 states and 30144 transitions. [2025-03-03 15:46:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:27,676 INFO L225 Difference]: With dead ends: 18004 [2025-03-03 15:46:27,676 INFO L226 Difference]: Without dead ends: 10559 [2025-03-03 15:46:27,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:27,696 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4356 mSDsluCounter, 8273 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:27,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12452 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-03-03 15:46:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 9579. [2025-03-03 15:46:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6005497022446176) internal successors, (13976), 8946 states have internal predecessors, (13976), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:46:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15870 transitions. [2025-03-03 15:46:28,309 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15870 transitions. Word has length 101 [2025-03-03 15:46:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15870 transitions. [2025-03-03 15:46:28,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15870 transitions. [2025-03-03 15:46:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:28,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:28,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:28,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:46:28,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:28,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1907289968, now seen corresponding path program 1 times [2025-03-03 15:46:28,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:28,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931201101] [2025-03-03 15:46:28,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:28,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:28,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:28,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931201101] [2025-03-03 15:46:28,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931201101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:28,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266002133] [2025-03-03 15:46:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:28,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:28,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:28,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:28,405 INFO L87 Difference]: Start difference. First operand 9579 states and 15870 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:28,830 INFO L93 Difference]: Finished difference Result 17759 states and 29588 transitions. [2025-03-03 15:46:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:28,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:28,865 INFO L225 Difference]: With dead ends: 17759 [2025-03-03 15:46:28,865 INFO L226 Difference]: Without dead ends: 10314 [2025-03-03 15:46:28,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-03-03 15:46:28,884 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4353 mSDsluCounter, 8268 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:28,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 12444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10314 states. [2025-03-03 15:46:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10314 to 9579. [2025-03-03 15:46:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.5967704993128722) internal successors, (13943), 8946 states have internal predecessors, (13943), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:46:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15837 transitions. [2025-03-03 15:46:29,229 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15837 transitions. Word has length 101 [2025-03-03 15:46:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:29,230 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15837 transitions. [2025-03-03 15:46:29,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15837 transitions. [2025-03-03 15:46:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:29,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:29,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:46:29,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1520625103, now seen corresponding path program 1 times [2025-03-03 15:46:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401001910] [2025-03-03 15:46:29,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:29,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:29,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:29,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:29,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401001910] [2025-03-03 15:46:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401001910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824929621] [2025-03-03 15:46:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:29,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:29,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:29,307 INFO L87 Difference]: Start difference. First operand 9579 states and 15837 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:30,169 INFO L93 Difference]: Finished difference Result 24974 states and 41916 transitions. [2025-03-03 15:46:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:30,219 INFO L225 Difference]: With dead ends: 24974 [2025-03-03 15:46:30,219 INFO L226 Difference]: Without dead ends: 17529 [2025-03-03 15:46:30,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:30,235 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4476 mSDsluCounter, 13008 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 17342 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 17342 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2025-03-03 15:46:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 17188. [2025-03-03 15:46:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 15311 states have (on average 1.5512376722617727) internal successors, (23751), 15979 states have internal predecessors, (23751), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-03 15:46:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 29485 transitions. [2025-03-03 15:46:31,204 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 29485 transitions. Word has length 101 [2025-03-03 15:46:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:31,205 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 29485 transitions. [2025-03-03 15:46:31,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 29485 transitions. [2025-03-03 15:46:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:46:31,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:31,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:31,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:46:31,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:31,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1077013680, now seen corresponding path program 1 times [2025-03-03 15:46:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:31,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585592717] [2025-03-03 15:46:31,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:46:31,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:46:31,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:31,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585592717] [2025-03-03 15:46:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585592717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:46:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674641379] [2025-03-03 15:46:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:31,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:46:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:31,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:46:31,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:31,271 INFO L87 Difference]: Start difference. First operand 17188 states and 29485 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:32,461 INFO L93 Difference]: Finished difference Result 46966 states and 80758 transitions. [2025-03-03 15:46:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-03 15:46:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:32,604 INFO L225 Difference]: With dead ends: 46966 [2025-03-03 15:46:32,604 INFO L226 Difference]: Without dead ends: 31913 [2025-03-03 15:46:32,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:32,640 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 4499 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 9021 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:32,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 9021 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31913 states. [2025-03-03 15:46:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31913 to 31848. [2025-03-03 15:46:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31848 states, 28100 states have (on average 1.5165836298932385) internal successors, (42616), 29499 states have internal predecessors, (42616), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-03 15:46:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31848 states to 31848 states and 54013 transitions. [2025-03-03 15:46:34,413 INFO L78 Accepts]: Start accepts. Automaton has 31848 states and 54013 transitions. Word has length 101 [2025-03-03 15:46:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 31848 states and 54013 transitions. [2025-03-03 15:46:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31848 states and 54013 transitions. [2025-03-03 15:46:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:46:34,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:34,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:34,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:46:34,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:34,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash -638692433, now seen corresponding path program 1 times [2025-03-03 15:46:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094946351] [2025-03-03 15:46:34,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:34,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:34,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:34,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094946351] [2025-03-03 15:46:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094946351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357379704] [2025-03-03 15:46:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:34,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:34,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:46:34,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:34,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:34,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:34,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:34,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:34,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:46:34,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357379704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835527306] [2025-03-03 15:46:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:34,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:34,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:34,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:34,714 INFO L87 Difference]: Start difference. First operand 31848 states and 54013 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:36,931 INFO L93 Difference]: Finished difference Result 90623 states and 153823 transitions. [2025-03-03 15:46:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 166 [2025-03-03 15:46:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:37,151 INFO L225 Difference]: With dead ends: 90623 [2025-03-03 15:46:37,151 INFO L226 Difference]: Without dead ends: 60910 [2025-03-03 15:46:37,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:37,224 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4219 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:37,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60910 states. [2025-03-03 15:46:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60910 to 60518. [2025-03-03 15:46:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60518 states, 53158 states have (on average 1.5041197938221904) internal successors, (79956), 55954 states have internal predecessors, (79956), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-03 15:46:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 102419 transitions. [2025-03-03 15:46:40,449 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 102419 transitions. Word has length 166 [2025-03-03 15:46:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:40,449 INFO L471 AbstractCegarLoop]: Abstraction has 60518 states and 102419 transitions. [2025-03-03 15:46:40,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 102419 transitions. [2025-03-03 15:46:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:46:40,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:40,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:40,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:46:40,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:46:40,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:40,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -229481751, now seen corresponding path program 1 times [2025-03-03 15:46:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004259690] [2025-03-03 15:46:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:40,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:40,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:40,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:40,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004259690] [2025-03-03 15:46:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004259690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075954686] [2025-03-03 15:46:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:40,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:40,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:40,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:46:40,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:40,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:40,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:40,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:40,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:40,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:46:40,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075954686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918815629] [2025-03-03 15:46:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:40,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:40,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:40,957 INFO L87 Difference]: Start difference. First operand 60518 states and 102419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:46,119 INFO L93 Difference]: Finished difference Result 175983 states and 298721 transitions. [2025-03-03 15:46:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:46,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 166 [2025-03-03 15:46:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:46,585 INFO L225 Difference]: With dead ends: 175983 [2025-03-03 15:46:46,586 INFO L226 Difference]: Without dead ends: 117600 [2025-03-03 15:46:46,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:46,710 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4213 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:46,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117600 states. [2025-03-03 15:46:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117600 to 116818. [2025-03-03 15:46:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116818 states, 102364 states have (on average 1.497948497518659) internal successors, (153336), 107954 states have internal predecessors, (153336), 6004 states have call successors, (6004), 3120 states have call predecessors, (6004), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-03 15:46:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116818 states to 116818 states and 197671 transitions. [2025-03-03 15:46:52,726 INFO L78 Accepts]: Start accepts. Automaton has 116818 states and 197671 transitions. Word has length 166 [2025-03-03 15:46:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 116818 states and 197671 transitions. [2025-03-03 15:46:52,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 116818 states and 197671 transitions. [2025-03-03 15:46:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:46:52,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:52,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:52,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:46:53,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash -304552541, now seen corresponding path program 1 times [2025-03-03 15:46:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:53,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448939524] [2025-03-03 15:46:53,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:53,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:53,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448939524] [2025-03-03 15:46:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448939524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774852170] [2025-03-03 15:46:53,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:53,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:53,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:46:53,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:46:53,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:46:53,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:53,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:53,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:53,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:46:53,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774852170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197353396] [2025-03-03 15:46:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:53,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:53,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:53,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:53,350 INFO L87 Difference]: Start difference. First operand 116818 states and 197671 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)