./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label45+token_ring.03.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 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:01:35,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:01:35,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:01:35,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:01:35,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:01:35,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:01:35,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:01:35,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:01:35,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:01:35,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:01:35,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:01:35,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:01:35,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:01:35,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:01:35,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:01:35,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:01:35,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:01:35,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:01:35,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:01:35,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:01:35,236 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 -> 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 [2025-03-16 20:01:35,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:01:35,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:01:35,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:01:35,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:01:35,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:01:35,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-03-16 20:01:36,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad6fb613/368d82eef9a5422eb7845a15c34de4cc/FLAGa6b18cb70 [2025-03-16 20:01:37,191 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:01:37,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-03-16 20:01:37,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad6fb613/368d82eef9a5422eb7845a15c34de4cc/FLAGa6b18cb70 [2025-03-16 20:01:37,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad6fb613/368d82eef9a5422eb7845a15c34de4cc [2025-03-16 20:01:37,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:01:37,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:01:37,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:01:37,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:01:37,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:01:37,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:01:37" (1/1) ... [2025-03-16 20:01:37,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1422b056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:37, skipping insertion in model container [2025-03-16 20:01:37,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:01:37" (1/1) ... [2025-03-16 20:01:37,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:01:38,936 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_label45+token_ring.03.cil-1.c[380323,380336] [2025-03-16 20:01:38,970 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_label45+token_ring.03.cil-1.c[383339,383352] [2025-03-16 20:01:39,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:01:39,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:01:39,634 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_label45+token_ring.03.cil-1.c[380323,380336] [2025-03-16 20:01:39,638 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_label45+token_ring.03.cil-1.c[383339,383352] [2025-03-16 20:01:39,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:01:39,724 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:01:39,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39 WrapperNode [2025-03-16 20:01:39,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:01:39,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:01:39,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:01:39,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:01:39,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:39,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,078 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-03-16 20:01:40,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:01:40,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:01:40,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:01:40,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:01:40,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,224 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-16 20:01:40,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:01:40,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:01:40,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:01:40,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:01:40,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (1/1) ... [2025-03-16 20:01:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:01:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:40,477 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-16 20:01:40,482 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-16 20:01:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:01:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:01:40,495 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:01:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:01:40,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:01:40,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:01:40,607 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:01:40,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:01:46,658 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:01:46,659 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:01:46,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:01:46,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:01:46,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:01:46,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:01:46,660 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:01:46,828 INFO L? ?]: Removed 1699 outVars from TransFormulas that were not future-live. [2025-03-16 20:01:46,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:01:46,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:01:46,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:01:46,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:01:46 BoogieIcfgContainer [2025-03-16 20:01:46,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:01:46,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:01:46,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:01:46,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:01:46,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:01:37" (1/3) ... [2025-03-16 20:01:46,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:01:46, skipping insertion in model container [2025-03-16 20:01:46,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:01:39" (2/3) ... [2025-03-16 20:01:46,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:01:46, skipping insertion in model container [2025-03-16 20:01:46,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:01:46" (3/3) ... [2025-03-16 20:01:46,890 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-1.c [2025-03-16 20:01:46,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:01:46,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.03.cil-1.c that has 8 procedures, 2277 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-16 20:01:46,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:01:46,990 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;@48441dad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:01:46,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:01:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 2277 states, 2249 states have (on average 1.879057358826145) internal successors, (4226), 2253 states have internal predecessors, (4226), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-16 20:01:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:47,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:47,011 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] [2025-03-16 20:01:47,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 46472052, now seen corresponding path program 1 times [2025-03-16 20:01:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845093416] [2025-03-16 20:01:47,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:47,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:47,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:47,371 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-16 20:01:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845093416] [2025-03-16 20:01:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845093416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400373330] [2025-03-16 20:01:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:47,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:47,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:47,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:47,399 INFO L87 Difference]: Start difference. First operand has 2277 states, 2249 states have (on average 1.879057358826145) internal successors, (4226), 2253 states have internal predecessors, (4226), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:47,798 INFO L93 Difference]: Finished difference Result 4699 states and 8763 transitions. [2025-03-16 20:01:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:01:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:47,822 INFO L225 Difference]: With dead ends: 4699 [2025-03-16 20:01:47,822 INFO L226 Difference]: Without dead ends: 2423 [2025-03-16 20:01:47,833 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-16 20:01:47,836 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4349 mSDsluCounter, 8371 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 12515 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:47,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4360 Valid, 12515 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:01:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2025-03-16 20:01:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2410. [2025-03-16 20:01:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2364 states have (on average 1.8358714043993232) internal successors, (4340), 2368 states have internal predecessors, (4340), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:01:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 4401 transitions. [2025-03-16 20:01:47,967 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 4401 transitions. Word has length 72 [2025-03-16 20:01:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:47,968 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 4401 transitions. [2025-03-16 20:01:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 4401 transitions. [2025-03-16 20:01:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:47,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:47,971 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] [2025-03-16 20:01:47,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:01:47,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 178403826, now seen corresponding path program 1 times [2025-03-16 20:01:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146726093] [2025-03-16 20:01:47,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:47,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:47,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:47,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:48,131 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-16 20:01:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146726093] [2025-03-16 20:01:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146726093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427964362] [2025-03-16 20:01:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:48,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:48,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:48,133 INFO L87 Difference]: Start difference. First operand 2410 states and 4401 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:48,336 INFO L93 Difference]: Finished difference Result 2714 states and 4875 transitions. [2025-03-16 20:01:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:48,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:48,349 INFO L225 Difference]: With dead ends: 2714 [2025-03-16 20:01:48,349 INFO L226 Difference]: Without dead ends: 2434 [2025-03-16 20:01:48,350 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-16 20:01:48,351 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 4241 mSDsluCounter, 8183 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 12309 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:48,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 12309 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-03-16 20:01:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2410. [2025-03-16 20:01:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2364 states have (on average 1.8350253807106598) internal successors, (4338), 2368 states have internal predecessors, (4338), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:01:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 4399 transitions. [2025-03-16 20:01:48,401 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 4399 transitions. Word has length 72 [2025-03-16 20:01:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 4399 transitions. [2025-03-16 20:01:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 4399 transitions. [2025-03-16 20:01:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:48,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:48,403 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] [2025-03-16 20:01:48,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:01:48,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:48,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 458753715, now seen corresponding path program 1 times [2025-03-16 20:01:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313911354] [2025-03-16 20:01:48,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:48,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:48,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:48,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:48,592 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-16 20:01:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313911354] [2025-03-16 20:01:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313911354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743904402] [2025-03-16 20:01:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:48,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:48,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:48,594 INFO L87 Difference]: Start difference. First operand 2410 states and 4399 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:48,971 INFO L93 Difference]: Finished difference Result 2861 states and 5090 transitions. [2025-03-16 20:01:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:48,981 INFO L225 Difference]: With dead ends: 2861 [2025-03-16 20:01:48,981 INFO L226 Difference]: Without dead ends: 2581 [2025-03-16 20:01:48,983 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-16 20:01:48,983 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4326 mSDsluCounter, 12721 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16971 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:48,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4337 Valid, 16971 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-16 20:01:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2540. [2025-03-16 20:01:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2475 states have (on average 1.821010101010101) internal successors, (4507), 2480 states have internal predecessors, (4507), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-16 20:01:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 4595 transitions. [2025-03-16 20:01:49,041 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 4595 transitions. Word has length 72 [2025-03-16 20:01:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:49,042 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 4595 transitions. [2025-03-16 20:01:49,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 4595 transitions. [2025-03-16 20:01:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:49,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:49,044 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] [2025-03-16 20:01:49,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:01:49,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:49,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1471865390, now seen corresponding path program 1 times [2025-03-16 20:01:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535454599] [2025-03-16 20:01:49,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:49,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:49,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:49,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:49,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:49,174 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-16 20:01:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:49,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535454599] [2025-03-16 20:01:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535454599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:49,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510340346] [2025-03-16 20:01:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:49,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:49,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:49,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:49,176 INFO L87 Difference]: Start difference. First operand 2540 states and 4595 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:49,541 INFO L93 Difference]: Finished difference Result 3264 states and 5703 transitions. [2025-03-16 20:01:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:49,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:49,552 INFO L225 Difference]: With dead ends: 3264 [2025-03-16 20:01:49,552 INFO L226 Difference]: Without dead ends: 2854 [2025-03-16 20:01:49,555 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-16 20:01:49,555 INFO L435 NwaCegarLoop]: 4246 mSDtfsCounter, 4321 mSDsluCounter, 12709 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 16955 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:49,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 16955 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-03-16 20:01:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2811. [2025-03-16 20:01:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2706 states have (on average 1.7960088691796008) internal successors, (4860), 2715 states have internal predecessors, (4860), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-03-16 20:01:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 5008 transitions. [2025-03-16 20:01:49,622 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 5008 transitions. Word has length 72 [2025-03-16 20:01:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:49,623 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 5008 transitions. [2025-03-16 20:01:49,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 5008 transitions. [2025-03-16 20:01:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:49,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:49,624 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] [2025-03-16 20:01:49,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:01:49,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:49,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash -841406765, now seen corresponding path program 1 times [2025-03-16 20:01:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141251113] [2025-03-16 20:01:49,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:49,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:49,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:49,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:49,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:01:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141251113] [2025-03-16 20:01:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141251113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:01:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727591117] [2025-03-16 20:01:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:01:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:01:49,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:01:49,718 INFO L87 Difference]: Start difference. First operand 2811 states and 5008 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:50,138 INFO L93 Difference]: Finished difference Result 4197 states and 7147 transitions. [2025-03-16 20:01:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:01:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:50,153 INFO L225 Difference]: With dead ends: 4197 [2025-03-16 20:01:50,153 INFO L226 Difference]: Without dead ends: 3516 [2025-03-16 20:01:50,156 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-16 20:01:50,157 INFO L435 NwaCegarLoop]: 4241 mSDtfsCounter, 4408 mSDsluCounter, 12689 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4423 SdHoareTripleChecker+Valid, 16930 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:50,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4423 Valid, 16930 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:01:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-03-16 20:01:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3368. [2025-03-16 20:01:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.757937755422823) internal successors, (5592), 3204 states have internal predecessors, (5592), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:01:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5876 transitions. [2025-03-16 20:01:50,246 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5876 transitions. Word has length 72 [2025-03-16 20:01:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:50,246 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5876 transitions. [2025-03-16 20:01:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5876 transitions. [2025-03-16 20:01:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:50,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:50,248 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] [2025-03-16 20:01:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:01:50,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -821069390, now seen corresponding path program 1 times [2025-03-16 20:01:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969102319] [2025-03-16 20:01:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:50,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:50,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:50,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:50,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:50,401 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-16 20:01:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969102319] [2025-03-16 20:01:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969102319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:50,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356174959] [2025-03-16 20:01:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:50,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:50,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:50,403 INFO L87 Difference]: Start difference. First operand 3368 states and 5876 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:50,655 INFO L93 Difference]: Finished difference Result 4722 states and 8008 transitions. [2025-03-16 20:01:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:50,670 INFO L225 Difference]: With dead ends: 4722 [2025-03-16 20:01:50,670 INFO L226 Difference]: Without dead ends: 3484 [2025-03-16 20:01:50,675 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-16 20:01:50,676 INFO L435 NwaCegarLoop]: 4117 mSDtfsCounter, 4233 mSDsluCounter, 8164 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 12281 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:50,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 12281 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2025-03-16 20:01:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3368. [2025-03-16 20:01:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.7551084564602326) internal successors, (5583), 3204 states have internal predecessors, (5583), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:01:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5867 transitions. [2025-03-16 20:01:50,807 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5867 transitions. Word has length 72 [2025-03-16 20:01:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:50,807 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5867 transitions. [2025-03-16 20:01:50,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5867 transitions. [2025-03-16 20:01:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:50,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:50,813 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] [2025-03-16 20:01:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:01:50,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -127676685, now seen corresponding path program 1 times [2025-03-16 20:01:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344549390] [2025-03-16 20:01:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:50,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:50,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:50,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:50,899 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-16 20:01:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344549390] [2025-03-16 20:01:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344549390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:01:50,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80650763] [2025-03-16 20:01:50,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:01:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:50,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:01:50,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:50,901 INFO L87 Difference]: Start difference. First operand 3368 states and 5867 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:51,119 INFO L93 Difference]: Finished difference Result 4664 states and 7874 transitions. [2025-03-16 20:01:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:51,133 INFO L225 Difference]: With dead ends: 4664 [2025-03-16 20:01:51,134 INFO L226 Difference]: Without dead ends: 3426 [2025-03-16 20:01:51,138 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-16 20:01:51,139 INFO L435 NwaCegarLoop]: 4112 mSDtfsCounter, 4229 mSDsluCounter, 8155 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4240 SdHoareTripleChecker+Valid, 12267 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:51,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4240 Valid, 12267 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2025-03-16 20:01:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3368. [2025-03-16 20:01:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3181 states have (on average 1.7522791574976422) internal successors, (5574), 3204 states have internal predecessors, (5574), 111 states have call successors, (111), 55 states have call predecessors, (111), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:01:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5858 transitions. [2025-03-16 20:01:51,242 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5858 transitions. Word has length 72 [2025-03-16 20:01:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5858 transitions. [2025-03-16 20:01:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5858 transitions. [2025-03-16 20:01:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:01:51,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:51,247 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] [2025-03-16 20:01:51,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:01:51,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:51,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2053209996, now seen corresponding path program 1 times [2025-03-16 20:01:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943792554] [2025-03-16 20:01:51,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:51,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:01:51,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:01:51,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:51,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:51,294 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-16 20:01:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943792554] [2025-03-16 20:01:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943792554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:01:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:01:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749157290] [2025-03-16 20:01:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:51,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:01:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:01:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:01:51,296 INFO L87 Difference]: Start difference. First operand 3368 states and 5858 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:51,472 INFO L93 Difference]: Finished difference Result 5756 states and 9562 transitions. [2025-03-16 20:01:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:01:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-16 20:01:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:51,494 INFO L225 Difference]: With dead ends: 5756 [2025-03-16 20:01:51,495 INFO L226 Difference]: Without dead ends: 4519 [2025-03-16 20:01:51,501 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-16 20:01:51,501 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4332 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 8653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 8653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:01:51,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-16 20:01:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4510. [2025-03-16 20:01:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4144 states have (on average 1.6821911196911197) internal successors, (6971), 4196 states have internal predecessors, (6971), 216 states have call successors, (216), 109 states have call predecessors, (216), 148 states have return successors, (335), 212 states have call predecessors, (335), 214 states have call successors, (335) [2025-03-16 20:01:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 7522 transitions. [2025-03-16 20:01:51,716 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 7522 transitions. Word has length 72 [2025-03-16 20:01:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:51,716 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 7522 transitions. [2025-03-16 20:01:51,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:01:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 7522 transitions. [2025-03-16 20:01:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:01:51,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:51,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:51,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:01:51,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1793053810, now seen corresponding path program 1 times [2025-03-16 20:01:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197224509] [2025-03-16 20:01:51,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:51,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:51,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:51,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:01:51,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197224509] [2025-03-16 20:01:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197224509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:01:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654067912] [2025-03-16 20:01:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:51,780 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-16 20:01:51,782 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-16 20:01:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:51,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:51,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:01:51,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:01:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 20:01:51,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:01:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654067912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:01:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:01:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664758781] [2025-03-16 20:01:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:01:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:01:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:51,932 INFO L87 Difference]: Start difference. First operand 4510 states and 7522 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:52,078 INFO L93 Difference]: Finished difference Result 9177 states and 14566 transitions. [2025-03-16 20:01:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:01:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2025-03-16 20:01:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:52,100 INFO L225 Difference]: With dead ends: 9177 [2025-03-16 20:01:52,100 INFO L226 Difference]: Without dead ends: 6798 [2025-03-16 20:01:52,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:52,109 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4376 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-16 20:01:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:01:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2025-03-16 20:01:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 6776. [2025-03-16 20:01:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6776 states, 6070 states have (on average 1.6191103789126853) internal successors, (9828), 6171 states have internal predecessors, (9828), 408 states have call successors, (408), 217 states have call predecessors, (408), 296 states have return successors, (641), 395 states have call predecessors, (641), 406 states have call successors, (641) [2025-03-16 20:01:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6776 states to 6776 states and 10877 transitions. [2025-03-16 20:01:52,323 INFO L78 Accepts]: Start accepts. Automaton has 6776 states and 10877 transitions. Word has length 116 [2025-03-16 20:01:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:52,323 INFO L471 AbstractCegarLoop]: Abstraction has 6776 states and 10877 transitions. [2025-03-16 20:01:52,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6776 states and 10877 transitions. [2025-03-16 20:01:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:01:52,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:52,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:52,336 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-16 20:01:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:52,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1146041800, now seen corresponding path program 1 times [2025-03-16 20:01:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587586747] [2025-03-16 20:01:52,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:52,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:52,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:52,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:01:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587586747] [2025-03-16 20:01:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587586747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:01:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322246189] [2025-03-16 20:01:52,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:52,593 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-16 20:01:52,594 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-16 20:01:52,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:52,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:52,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:01:52,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:01:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:01:52,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:01:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322246189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:52,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:01:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:01:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568727065] [2025-03-16 20:01:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:52,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:01:52,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:52,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:01:52,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:52,771 INFO L87 Difference]: Start difference. First operand 6776 states and 10877 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:53,043 INFO L93 Difference]: Finished difference Result 15933 states and 24651 transitions. [2025-03-16 20:01:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:01:53,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2025-03-16 20:01:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:53,081 INFO L225 Difference]: With dead ends: 15933 [2025-03-16 20:01:53,082 INFO L226 Difference]: Without dead ends: 11288 [2025-03-16 20:01:53,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:53,100 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4133 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4133 SdHoareTripleChecker+Valid, 4376 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-16 20:01:53,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4133 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:01:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2025-03-16 20:01:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 11248. [2025-03-16 20:01:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11248 states, 9864 states have (on average 1.5642741281427412) internal successors, (15430), 10063 states have internal predecessors, (15430), 790 states have call successors, (790), 433 states have call predecessors, (790), 592 states have return successors, (1251), 759 states have call predecessors, (1251), 788 states have call successors, (1251) [2025-03-16 20:01:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 17471 transitions. [2025-03-16 20:01:53,560 INFO L78 Accepts]: Start accepts. Automaton has 11248 states and 17471 transitions. Word has length 116 [2025-03-16 20:01:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:53,560 INFO L471 AbstractCegarLoop]: Abstraction has 11248 states and 17471 transitions. [2025-03-16 20:01:53,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 11248 states and 17471 transitions. [2025-03-16 20:01:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:01:53,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:53,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:53,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:01:53,770 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,SelfDestructingSolverStorable9 [2025-03-16 20:01:53,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:53,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash 144518990, now seen corresponding path program 1 times [2025-03-16 20:01:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056776158] [2025-03-16 20:01:53,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:53,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:53,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:01:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056776158] [2025-03-16 20:01:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056776158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:01:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972557062] [2025-03-16 20:01:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:53,830 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-16 20:01:53,832 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-16 20:01:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:53,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:53,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:53,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:53,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:01:53,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:01:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 20:01:53,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:01:53,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972557062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:53,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:01:53,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:01:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344985426] [2025-03-16 20:01:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:53,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:01:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:53,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:01:53,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:53,959 INFO L87 Difference]: Start difference. First operand 11248 states and 17471 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:54,770 INFO L93 Difference]: Finished difference Result 29121 states and 44231 transitions. [2025-03-16 20:01:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:01:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2025-03-16 20:01:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:54,858 INFO L225 Difference]: With dead ends: 29121 [2025-03-16 20:01:54,858 INFO L226 Difference]: Without dead ends: 20004 [2025-03-16 20:01:54,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:54,897 INFO L435 NwaCegarLoop]: 4178 mSDtfsCounter, 4143 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 4376 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-16 20:01:54,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 4376 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:01:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20004 states. [2025-03-16 20:01:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20004 to 19928. [2025-03-16 20:01:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19928 states, 17240 states have (on average 1.5263341067285383) internal successors, (26314), 17635 states have internal predecessors, (26314), 1502 states have call successors, (1502), 865 states have call predecessors, (1502), 1184 states have return successors, (2419), 1435 states have call predecessors, (2419), 1500 states have call successors, (2419) [2025-03-16 20:01:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19928 states to 19928 states and 30235 transitions. [2025-03-16 20:01:55,742 INFO L78 Accepts]: Start accepts. Automaton has 19928 states and 30235 transitions. Word has length 116 [2025-03-16 20:01:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 19928 states and 30235 transitions. [2025-03-16 20:01:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:01:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19928 states and 30235 transitions. [2025-03-16 20:01:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 20:01:55,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:55,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:01:55,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:01:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:55,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash -230852268, now seen corresponding path program 1 times [2025-03-16 20:01:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:55,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384957828] [2025-03-16 20:01:55,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:55,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:55,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:55,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:55,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:01:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384957828] [2025-03-16 20:01:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384957828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:01:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149287816] [2025-03-16 20:01:56,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:56,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:01:56,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:01:56,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 20:01:56,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 20:01:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:56,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:01:56,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:01:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:01:56,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:01:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149287816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:56,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:01:56,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:01:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196486784] [2025-03-16 20:01:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:56,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:01:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:56,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:01:56,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:56,129 INFO L87 Difference]: Start difference. First operand 19928 states and 30235 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 20:01:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:01:57,093 INFO L93 Difference]: Finished difference Result 54149 states and 81555 transitions. [2025-03-16 20:01:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:01:57,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2025-03-16 20:01:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:01:57,260 INFO L225 Difference]: With dead ends: 54149 [2025-03-16 20:01:57,261 INFO L226 Difference]: Without dead ends: 36353 [2025-03-16 20:01:57,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:57,398 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 184 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 8543 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:01:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 8543 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:01:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36353 states. [2025-03-16 20:01:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36353 to 36353. [2025-03-16 20:01:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36353 states, 31178 states have (on average 1.4953813586503304) internal successors, (46623), 31894 states have internal predecessors, (46623), 2831 states have call successors, (2831), 1703 states have call predecessors, (2831), 2342 states have return successors, (5130), 2771 states have call predecessors, (5130), 2829 states have call successors, (5130) [2025-03-16 20:01:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36353 states to 36353 states and 54584 transitions. [2025-03-16 20:01:59,219 INFO L78 Accepts]: Start accepts. Automaton has 36353 states and 54584 transitions. Word has length 116 [2025-03-16 20:01:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:01:59,220 INFO L471 AbstractCegarLoop]: Abstraction has 36353 states and 54584 transitions. [2025-03-16 20:01:59,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 20:01:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36353 states and 54584 transitions. [2025-03-16 20:01:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:01:59,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:01:59,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:01:59,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:01:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:59,518 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:01:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:01:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2045656101, now seen corresponding path program 1 times [2025-03-16 20:01:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:01:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404952862] [2025-03-16 20:01:59,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:01:59,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:01:59,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:01:59,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:59,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 20:01:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:01:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404952862] [2025-03-16 20:01:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404952862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:01:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581859134] [2025-03-16 20:01:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:01:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:01:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:01:59,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:01:59,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:01:59,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:01:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:01:59,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:01:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:01:59,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:01:59,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:01:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:01:59,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:01:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581859134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:01:59,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:01:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:01:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209106155] [2025-03-16 20:01:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:01:59,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:01:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:01:59,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:01:59,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:01:59,829 INFO L87 Difference]: Start difference. First operand 36353 states and 54584 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:02:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:01,122 INFO L93 Difference]: Finished difference Result 59347 states and 89189 transitions. [2025-03-16 20:02:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:01,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 167 [2025-03-16 20:02:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:01,238 INFO L225 Difference]: With dead ends: 59347 [2025-03-16 20:02:01,238 INFO L226 Difference]: Without dead ends: 32021 [2025-03-16 20:02:01,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:01,290 INFO L435 NwaCegarLoop]: 4175 mSDtfsCounter, 4112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:01,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 4215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32021 states. [2025-03-16 20:02:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32021 to 24509. [2025-03-16 20:02:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24509 states, 21270 states have (on average 1.4617301363422661) internal successors, (31091), 21510 states have internal predecessors, (31091), 1851 states have call successors, (1851), 1195 states have call predecessors, (1851), 1386 states have return successors, (2610), 1811 states have call predecessors, (2610), 1849 states have call successors, (2610) [2025-03-16 20:02:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24509 states to 24509 states and 35552 transitions. [2025-03-16 20:02:02,354 INFO L78 Accepts]: Start accepts. Automaton has 24509 states and 35552 transitions. Word has length 167 [2025-03-16 20:02:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:02,355 INFO L471 AbstractCegarLoop]: Abstraction has 24509 states and 35552 transitions. [2025-03-16 20:02:02,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:02:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 24509 states and 35552 transitions. [2025-03-16 20:02:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:02:02,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:02,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:02:02,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:02:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 20:02:02,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 259824998, now seen corresponding path program 1 times [2025-03-16 20:02:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64245921] [2025-03-16 20:02:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:02,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:02:02,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:02:02,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:02,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:02:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64245921] [2025-03-16 20:02:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64245921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758647243] [2025-03-16 20:02:02,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:02,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:02,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:02:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:02:02,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:02:02,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:02,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:02,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:02:02,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:02:02,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758647243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:02,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:02:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885047135] [2025-03-16 20:02:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:02,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:02,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:02,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:02,832 INFO L87 Difference]: Start difference. First operand 24509 states and 35552 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:02:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:03,716 INFO L93 Difference]: Finished difference Result 49229 states and 71251 transitions. [2025-03-16 20:02:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 167 [2025-03-16 20:02:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:03,810 INFO L225 Difference]: With dead ends: 49229 [2025-03-16 20:02:03,810 INFO L226 Difference]: Without dead ends: 26859 [2025-03-16 20:02:03,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:03,842 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4128 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4128 SdHoareTripleChecker+Valid, 4212 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:03,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 4212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26859 states. [2025-03-16 20:02:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26859 to 26859. [2025-03-16 20:02:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26859 states, 23400 states have (on average 1.4241452991452992) internal successors, (33325), 23640 states have internal predecessors, (33325), 1917 states have call successors, (1917), 1349 states have call predecessors, (1917), 1540 states have return successors, (2698), 1877 states have call predecessors, (2698), 1915 states have call successors, (2698) [2025-03-16 20:02:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26859 states to 26859 states and 37940 transitions. [2025-03-16 20:02:05,020 INFO L78 Accepts]: Start accepts. Automaton has 26859 states and 37940 transitions. Word has length 167 [2025-03-16 20:02:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 26859 states and 37940 transitions. [2025-03-16 20:02:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:02:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26859 states and 37940 transitions. [2025-03-16 20:02:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:02:05,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:05,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:02:05,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:02:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:05,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash -875111669, now seen corresponding path program 1 times [2025-03-16 20:02:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719212531] [2025-03-16 20:02:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:05,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:02:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:02:05,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:05,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:02:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719212531] [2025-03-16 20:02:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719212531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764170802] [2025-03-16 20:02:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:05,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:02:05,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:02:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:02:05,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:05,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:05,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 20:02:05,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 20:02:05,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764170802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:05,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:02:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003979071] [2025-03-16 20:02:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:05,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:05,553 INFO L87 Difference]: Start difference. First operand 26859 states and 37940 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:02:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:06,847 INFO L93 Difference]: Finished difference Result 47804 states and 66488 transitions. [2025-03-16 20:02:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:06,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 167 [2025-03-16 20:02:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:06,946 INFO L225 Difference]: With dead ends: 47804 [2025-03-16 20:02:06,946 INFO L226 Difference]: Without dead ends: 28967 [2025-03-16 20:02:06,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:06,984 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4106 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4435 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:06,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4435 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28967 states. [2025-03-16 20:02:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28967 to 28835. [2025-03-16 20:02:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28835 states, 25200 states have (on average 1.3989285714285715) internal successors, (35253), 25440 states have internal predecessors, (35253), 1961 states have call successors, (1961), 1481 states have call predecessors, (1961), 1672 states have return successors, (2874), 1921 states have call predecessors, (2874), 1959 states have call successors, (2874) [2025-03-16 20:02:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28835 states to 28835 states and 40088 transitions. [2025-03-16 20:02:08,465 INFO L78 Accepts]: Start accepts. Automaton has 28835 states and 40088 transitions. Word has length 167 [2025-03-16 20:02:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 28835 states and 40088 transitions. [2025-03-16 20:02:08,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:02:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28835 states and 40088 transitions. [2025-03-16 20:02:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:02:08,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:08,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:02:08,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:02:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:08,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 924180085, now seen corresponding path program 1 times [2025-03-16 20:02:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736796665] [2025-03-16 20:02:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:02:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:02:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:02:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736796665] [2025-03-16 20:02:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736796665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035007058] [2025-03-16 20:02:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:08,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:08,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:02:08,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:02:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:02:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:08,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:02:08,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:02:08,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035007058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:08,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:02:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692537520] [2025-03-16 20:02:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:08,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:08,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:08,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:08,927 INFO L87 Difference]: Start difference. First operand 28835 states and 40088 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:02:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:10,544 INFO L93 Difference]: Finished difference Result 79043 states and 109418 transitions. [2025-03-16 20:02:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:10,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2025-03-16 20:02:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:10,777 INFO L225 Difference]: With dead ends: 79043 [2025-03-16 20:02:10,778 INFO L226 Difference]: Without dead ends: 52347 [2025-03-16 20:02:10,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:10,856 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 178 mSDsluCounter, 4168 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 8534 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:10,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 8534 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:02:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52347 states. [2025-03-16 20:02:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52347 to 52343. [2025-03-16 20:02:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52343 states, 45398 states have (on average 1.3740473148596855) internal successors, (62379), 45876 states have internal predecessors, (62379), 3759 states have call successors, (3759), 2801 states have call predecessors, (3759), 3184 states have return successors, (6658), 3681 states have call predecessors, (6658), 3757 states have call successors, (6658) [2025-03-16 20:02:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52343 states to 52343 states and 72796 transitions. [2025-03-16 20:02:13,197 INFO L78 Accepts]: Start accepts. Automaton has 52343 states and 72796 transitions. Word has length 168 [2025-03-16 20:02:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 52343 states and 72796 transitions. [2025-03-16 20:02:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:02:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 52343 states and 72796 transitions. [2025-03-16 20:02:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 20:02:13,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:13,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:02:13,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 20:02:13,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:02:13,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1147957032, now seen corresponding path program 1 times [2025-03-16 20:02:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084903305] [2025-03-16 20:02:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:13,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:02:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:02:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 20:02:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084903305] [2025-03-16 20:02:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084903305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:02:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835163107] [2025-03-16 20:02:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:13,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:02:13,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:13,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:02:13,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 20:02:13,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 20:02:13,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 20:02:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:13,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:13,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:02:13,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:02:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 20:02:13,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:02:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835163107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:13,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:02:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:02:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644028291] [2025-03-16 20:02:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:13,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:02:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:13,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:02:13,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:13,675 INFO L87 Difference]: Start difference. First operand 52343 states and 72796 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:02:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:15,821 INFO L93 Difference]: Finished difference Result 105963 states and 148667 transitions. [2025-03-16 20:02:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:02:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 169 [2025-03-16 20:02:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:16,015 INFO L225 Difference]: With dead ends: 105963 [2025-03-16 20:02:16,015 INFO L226 Difference]: Without dead ends: 55767 [2025-03-16 20:02:16,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:16,095 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4136 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:16,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 4219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:02:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55767 states.