./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-2.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_label42+token_ring.04.cil-2.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 3a629e5533750136bdc4ecf4cf9ae4f163f3dcd9918add7f5bb2c2e476f05d0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:56:57,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:56:57,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:56:57,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:56:57,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:56:57,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:56:57,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:56:57,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:56:57,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:56:57,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:56:57,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:56:57,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:56:57,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:56:57,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:56:57,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:56:57,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:56:57,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:56:57,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:56:57,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:56:57,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:56:57,353 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 -> 3a629e5533750136bdc4ecf4cf9ae4f163f3dcd9918add7f5bb2c2e476f05d0e [2025-03-16 19:56:57,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:56:57,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:56:57,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:56:57,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:56:57,628 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:56:57,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-2.c [2025-03-16 19:56:58,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a5251b7/e546b6c930e8403ba96282ec5277b2f9/FLAGe1fcf76c5 [2025-03-16 19:56:59,351 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:56:59,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-2.c [2025-03-16 19:56:59,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a5251b7/e546b6c930e8403ba96282ec5277b2f9/FLAGe1fcf76c5 [2025-03-16 19:56:59,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a5251b7/e546b6c930e8403ba96282ec5277b2f9 [2025-03-16 19:56:59,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:56:59,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:56:59,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:56:59,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:56:59,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:56:59,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:56:59" (1/1) ... [2025-03-16 19:56:59,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad0d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:56:59, skipping insertion in model container [2025-03-16 19:56:59,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:56:59" (1/1) ... [2025-03-16 19:56:59,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:57:01,046 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_label42+token_ring.04.cil-2.c[378560,378573] [2025-03-16 19:57:01,076 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_label42+token_ring.04.cil-2.c[383339,383352] [2025-03-16 19:57:01,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:01,222 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:57:01,753 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_label42+token_ring.04.cil-2.c[378560,378573] [2025-03-16 19:57:01,769 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_label42+token_ring.04.cil-2.c[383339,383352] [2025-03-16 19:57:01,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:01,821 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:57:01,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01 WrapperNode [2025-03-16 19:57:01,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:01,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:01,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:57:01,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:57:01,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:01,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,215 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-03-16 19:57:02,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:02,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:57:02,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:57:02,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:57:02,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,363 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 19:57:02,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:57:02,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:57:02,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:57:02,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:57:02,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (1/1) ... [2025-03-16 19:57:02,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:02,671 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 19:57:02,675 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 19:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:57:02,708 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:57:02,708 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:57:02,708 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:57:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:57:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:57:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:57:02,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:57:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:57:02,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:57:02,827 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:57:08,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:57:08,697 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:57:08,698 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:57:08,698 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:57:08,698 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:57:08,699 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:57:08,700 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:57:08,877 INFO L? ?]: Removed 1704 outVars from TransFormulas that were not future-live. [2025-03-16 19:57:08,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:57:08,929 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:57:08,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:57:08,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:08 BoogieIcfgContainer [2025-03-16 19:57:08,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:57:08,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:57:08,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:57:08,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:57:08,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:56:59" (1/3) ... [2025-03-16 19:57:08,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e48b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:08, skipping insertion in model container [2025-03-16 19:57:08,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:01" (2/3) ... [2025-03-16 19:57:08,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e48b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:08, skipping insertion in model container [2025-03-16 19:57:08,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:08" (3/3) ... [2025-03-16 19:57:08,938 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.04.cil-2.c [2025-03-16 19:57:08,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:57:08,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.04.cil-2.c that has 8 procedures, 2301 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-16 19:57:09,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:57:09,048 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;@4511914a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:57:09,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:57:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 2301 states, 2272 states have (on average 1.877200704225352) internal successors, (4265), 2276 states have internal predecessors, (4265), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 19:57:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:09,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:09,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash -509594735, now seen corresponding path program 1 times [2025-03-16 19:57:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812505215] [2025-03-16 19:57:09,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:09,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:09,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:09,475 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 19:57:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812505215] [2025-03-16 19:57:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812505215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697500066] [2025-03-16 19:57:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:09,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:09,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:09,504 INFO L87 Difference]: Start difference. First operand has 2301 states, 2272 states have (on average 1.877200704225352) internal successors, (4265), 2276 states have internal predecessors, (4265), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:09,934 INFO L93 Difference]: Finished difference Result 4773 states and 8890 transitions. [2025-03-16 19:57:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:57:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:09,957 INFO L225 Difference]: With dead ends: 4773 [2025-03-16 19:57:09,957 INFO L226 Difference]: Without dead ends: 2474 [2025-03-16 19:57:09,966 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 19:57:09,968 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4431 mSDsluCounter, 8455 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:09,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 12631 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2025-03-16 19:57:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2459. [2025-03-16 19:57:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2411 states have (on average 1.832434674408959) internal successors, (4418), 2415 states have internal predecessors, (4418), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-16 19:57:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4483 transitions. [2025-03-16 19:57:10,185 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4483 transitions. Word has length 82 [2025-03-16 19:57:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:10,186 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4483 transitions. [2025-03-16 19:57:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4483 transitions. [2025-03-16 19:57:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:10,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:10,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:10,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:57:10,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:10,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1010644367, now seen corresponding path program 1 times [2025-03-16 19:57:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638926374] [2025-03-16 19:57:10,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:10,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:10,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:10,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:10,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:10,381 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 19:57:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:10,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638926374] [2025-03-16 19:57:10,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638926374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:10,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:10,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417694608] [2025-03-16 19:57:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:10,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:10,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:10,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:10,384 INFO L87 Difference]: Start difference. First operand 2459 states and 4483 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:10,592 INFO L93 Difference]: Finished difference Result 2817 states and 5049 transitions. [2025-03-16 19:57:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:10,602 INFO L225 Difference]: With dead ends: 2817 [2025-03-16 19:57:10,603 INFO L226 Difference]: Without dead ends: 2489 [2025-03-16 19:57:10,605 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 19:57:10,605 INFO L435 NwaCegarLoop]: 4139 mSDtfsCounter, 4315 mSDsluCounter, 8218 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4327 SdHoareTripleChecker+Valid, 12357 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:10,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4327 Valid, 12357 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-16 19:57:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2459. [2025-03-16 19:57:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2411 states have (on average 1.8316051430941518) internal successors, (4416), 2415 states have internal predecessors, (4416), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-16 19:57:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2025-03-16 19:57:10,661 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 82 [2025-03-16 19:57:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:10,661 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2025-03-16 19:57:10,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2025-03-16 19:57:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:10,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:10,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:10,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:57:10,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1613809360, now seen corresponding path program 1 times [2025-03-16 19:57:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377164247] [2025-03-16 19:57:10,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:10,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:10,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:10,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:10,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:10,775 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 19:57:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377164247] [2025-03-16 19:57:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377164247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186010504] [2025-03-16 19:57:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:10,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:10,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:10,777 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:11,216 INFO L93 Difference]: Finished difference Result 2991 states and 5310 transitions. [2025-03-16 19:57:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:11,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:11,227 INFO L225 Difference]: With dead ends: 2991 [2025-03-16 19:57:11,228 INFO L226 Difference]: Without dead ends: 2663 [2025-03-16 19:57:11,231 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 19:57:11,232 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4410 mSDsluCounter, 12895 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 17200 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:11,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 17200 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-16 19:57:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2612. [2025-03-16 19:57:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2544 states have (on average 1.816430817610063) internal successors, (4621), 2549 states have internal predecessors, (4621), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-16 19:57:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4715 transitions. [2025-03-16 19:57:11,291 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 4715 transitions. Word has length 82 [2025-03-16 19:57:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:11,291 INFO L471 AbstractCegarLoop]: Abstraction has 2612 states and 4715 transitions. [2025-03-16 19:57:11,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 4715 transitions. [2025-03-16 19:57:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:11,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:11,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:11,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:57:11,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1005732497, now seen corresponding path program 1 times [2025-03-16 19:57:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639216625] [2025-03-16 19:57:11,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:11,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:11,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 19:57:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639216625] [2025-03-16 19:57:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639216625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:11,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:11,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197301494] [2025-03-16 19:57:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:11,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:11,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:11,402 INFO L87 Difference]: Start difference. First operand 2612 states and 4715 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:11,811 INFO L93 Difference]: Finished difference Result 3469 states and 6049 transitions. [2025-03-16 19:57:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:11,822 INFO L225 Difference]: With dead ends: 3469 [2025-03-16 19:57:11,823 INFO L226 Difference]: Without dead ends: 2988 [2025-03-16 19:57:11,825 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 19:57:11,826 INFO L435 NwaCegarLoop]: 4301 mSDtfsCounter, 4405 mSDsluCounter, 12883 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 17184 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:11,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 17184 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2025-03-16 19:57:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2933. [2025-03-16 19:57:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2823 states have (on average 1.7902940134608571) internal successors, (5054), 2832 states have internal predecessors, (5054), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-16 19:57:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 5212 transitions. [2025-03-16 19:57:11,899 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 5212 transitions. Word has length 82 [2025-03-16 19:57:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:11,900 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 5212 transitions. [2025-03-16 19:57:11,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 5212 transitions. [2025-03-16 19:57:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:11,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:11,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:57:11,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1507734864, now seen corresponding path program 1 times [2025-03-16 19:57:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417972041] [2025-03-16 19:57:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:11,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:11,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:11,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:11,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:12,050 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 19:57:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417972041] [2025-03-16 19:57:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417972041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821975459] [2025-03-16 19:57:12,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:12,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:12,053 INFO L87 Difference]: Start difference. First operand 2933 states and 5212 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:12,524 INFO L93 Difference]: Finished difference Result 4480 states and 7640 transitions. [2025-03-16 19:57:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:12,541 INFO L225 Difference]: With dead ends: 4480 [2025-03-16 19:57:12,541 INFO L226 Difference]: Without dead ends: 3678 [2025-03-16 19:57:12,545 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 19:57:12,547 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4400 mSDsluCounter, 12874 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 17172 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:12,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 17172 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2025-03-16 19:57:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3614. [2025-03-16 19:57:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3414 states have (on average 1.7510251903925014) internal successors, (5978), 3437 states have internal predecessors, (5978), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-16 19:57:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6288 transitions. [2025-03-16 19:57:12,692 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 6288 transitions. Word has length 82 [2025-03-16 19:57:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 6288 transitions. [2025-03-16 19:57:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 6288 transitions. [2025-03-16 19:57:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:12,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:12,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:57:12,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash -203341135, now seen corresponding path program 1 times [2025-03-16 19:57:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984771100] [2025-03-16 19:57:12,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:12,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:12,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:12,820 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 19:57:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984771100] [2025-03-16 19:57:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984771100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059061700] [2025-03-16 19:57:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:12,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:12,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:12,823 INFO L87 Difference]: Start difference. First operand 3614 states and 6288 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:13,410 INFO L93 Difference]: Finished difference Result 6863 states and 11491 transitions. [2025-03-16 19:57:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:13,433 INFO L225 Difference]: With dead ends: 6863 [2025-03-16 19:57:13,433 INFO L226 Difference]: Without dead ends: 5380 [2025-03-16 19:57:13,439 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 19:57:13,441 INFO L435 NwaCegarLoop]: 4293 mSDtfsCounter, 4433 mSDsluCounter, 12854 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4444 SdHoareTripleChecker+Valid, 17147 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:13,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4444 Valid, 17147 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2025-03-16 19:57:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5051. [2025-03-16 19:57:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4661 states have (on average 1.7056425659729673) internal successors, (7950), 4730 states have internal predecessors, (7950), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-16 19:57:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 8644 transitions. [2025-03-16 19:57:13,597 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 8644 transitions. Word has length 82 [2025-03-16 19:57:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:13,598 INFO L471 AbstractCegarLoop]: Abstraction has 5051 states and 8644 transitions. [2025-03-16 19:57:13,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 8644 transitions. [2025-03-16 19:57:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:13,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:13,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:57:13,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1916946064, now seen corresponding path program 1 times [2025-03-16 19:57:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862060795] [2025-03-16 19:57:13,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:13,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:13,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:13,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:13,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:13,673 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 19:57:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862060795] [2025-03-16 19:57:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862060795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726250388] [2025-03-16 19:57:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:13,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:13,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:13,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:13,674 INFO L87 Difference]: Start difference. First operand 5051 states and 8644 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:14,008 INFO L93 Difference]: Finished difference Result 8386 states and 14186 transitions. [2025-03-16 19:57:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:14,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:14,028 INFO L225 Difference]: With dead ends: 8386 [2025-03-16 19:57:14,029 INFO L226 Difference]: Without dead ends: 5466 [2025-03-16 19:57:14,035 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 19:57:14,035 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4289 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4301 SdHoareTripleChecker+Valid, 12361 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:14,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4301 Valid, 12361 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2025-03-16 19:57:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5051. [2025-03-16 19:57:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5051 states, 4661 states have (on average 1.7019952799828364) internal successors, (7933), 4730 states have internal predecessors, (7933), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-16 19:57:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 8627 transitions. [2025-03-16 19:57:14,193 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 8627 transitions. Word has length 82 [2025-03-16 19:57:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 5051 states and 8627 transitions. [2025-03-16 19:57:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 8627 transitions. [2025-03-16 19:57:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:14,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:14,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:14,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:57:14,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1708247761, now seen corresponding path program 1 times [2025-03-16 19:57:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857940638] [2025-03-16 19:57:14,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:14,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:14,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:14,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:14,289 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 19:57:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857940638] [2025-03-16 19:57:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857940638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074143981] [2025-03-16 19:57:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:14,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:14,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:14,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:14,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:14,291 INFO L87 Difference]: Start difference. First operand 5051 states and 8627 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:14,816 INFO L93 Difference]: Finished difference Result 11378 states and 19122 transitions. [2025-03-16 19:57:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:14,850 INFO L225 Difference]: With dead ends: 11378 [2025-03-16 19:57:14,850 INFO L226 Difference]: Without dead ends: 8458 [2025-03-16 19:57:14,863 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 19:57:14,864 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 4447 mSDsluCounter, 12831 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 17116 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:14,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 17116 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2025-03-16 19:57:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8063. [2025-03-16 19:57:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6557196081137022) internal successors, (11999), 7462 states have internal predecessors, (11999), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13829 transitions. [2025-03-16 19:57:15,232 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13829 transitions. Word has length 82 [2025-03-16 19:57:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:15,232 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13829 transitions. [2025-03-16 19:57:15,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13829 transitions. [2025-03-16 19:57:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:15,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:15,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:15,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:57:15,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:15,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash -99599760, now seen corresponding path program 1 times [2025-03-16 19:57:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440386979] [2025-03-16 19:57:15,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:15,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:15,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:15,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:15,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:15,292 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 19:57:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440386979] [2025-03-16 19:57:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440386979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571042408] [2025-03-16 19:57:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:15,294 INFO L87 Difference]: Start difference. First operand 8063 states and 13829 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:15,660 INFO L93 Difference]: Finished difference Result 14730 states and 25510 transitions. [2025-03-16 19:57:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:15,691 INFO L225 Difference]: With dead ends: 14730 [2025-03-16 19:57:15,691 INFO L226 Difference]: Without dead ends: 8798 [2025-03-16 19:57:15,707 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 19:57:15,708 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4285 mSDsluCounter, 8205 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 12347 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:15,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 12347 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2025-03-16 19:57:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 8063. [2025-03-16 19:57:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6511659997240238) internal successors, (11966), 7462 states have internal predecessors, (11966), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13796 transitions. [2025-03-16 19:57:16,079 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13796 transitions. Word has length 82 [2025-03-16 19:57:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13796 transitions. [2025-03-16 19:57:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13796 transitions. [2025-03-16 19:57:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:16,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:16,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:16,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:57:16,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:16,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1266296079, now seen corresponding path program 1 times [2025-03-16 19:57:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471764900] [2025-03-16 19:57:16,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:16,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:16,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:16,146 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 19:57:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471764900] [2025-03-16 19:57:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471764900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567715969] [2025-03-16 19:57:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:16,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:16,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:16,148 INFO L87 Difference]: Start difference. First operand 8063 states and 13796 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:16,547 INFO L93 Difference]: Finished difference Result 14485 states and 24954 transitions. [2025-03-16 19:57:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:16,578 INFO L225 Difference]: With dead ends: 14485 [2025-03-16 19:57:16,578 INFO L226 Difference]: Without dead ends: 8553 [2025-03-16 19:57:16,596 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 19:57:16,596 INFO L435 NwaCegarLoop]: 4136 mSDtfsCounter, 4283 mSDsluCounter, 8197 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4295 SdHoareTripleChecker+Valid, 12333 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:16,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4295 Valid, 12333 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2025-03-16 19:57:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 8063. [2025-03-16 19:57:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 7247 states have (on average 1.6466123913343453) internal successors, (11933), 7462 states have internal predecessors, (11933), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-16 19:57:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 13763 transitions. [2025-03-16 19:57:17,134 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 13763 transitions. Word has length 82 [2025-03-16 19:57:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:17,135 INFO L471 AbstractCegarLoop]: Abstraction has 8063 states and 13763 transitions. [2025-03-16 19:57:17,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 13763 transitions. [2025-03-16 19:57:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:17,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:17,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:17,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:57:17,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1165384112, now seen corresponding path program 1 times [2025-03-16 19:57:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22533] [2025-03-16 19:57:17,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:17,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:17,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:17,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:17,193 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 19:57:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22533] [2025-03-16 19:57:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199417643] [2025-03-16 19:57:17,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:17,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:17,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:17,196 INFO L87 Difference]: Start difference. First operand 8063 states and 13763 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:17,774 INFO L93 Difference]: Finished difference Result 19807 states and 33319 transitions. [2025-03-16 19:57:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:17,822 INFO L225 Difference]: With dead ends: 19807 [2025-03-16 19:57:17,822 INFO L226 Difference]: Without dead ends: 13876 [2025-03-16 19:57:17,841 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 19:57:17,843 INFO L435 NwaCegarLoop]: 4446 mSDtfsCounter, 4422 mSDsluCounter, 4377 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8823 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:17,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8823 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:57:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13876 states. [2025-03-16 19:57:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13876 to 13839. [2025-03-16 19:57:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 12232 states have (on average 1.6047253106605626) internal successors, (19629), 12659 states have internal predecessors, (19629), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:57:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 23214 transitions. [2025-03-16 19:57:18,375 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 23214 transitions. Word has length 82 [2025-03-16 19:57:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:18,375 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 23214 transitions. [2025-03-16 19:57:18,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 23214 transitions. [2025-03-16 19:57:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:18,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:18,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:57:18,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1390405523, now seen corresponding path program 1 times [2025-03-16 19:57:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683865797] [2025-03-16 19:57:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:18,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:18,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:18,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:18,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:18,424 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 19:57:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683865797] [2025-03-16 19:57:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683865797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431903265] [2025-03-16 19:57:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:18,427 INFO L87 Difference]: Start difference. First operand 13839 states and 23214 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:18,832 INFO L93 Difference]: Finished difference Result 25678 states and 43033 transitions. [2025-03-16 19:57:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:18,876 INFO L225 Difference]: With dead ends: 25678 [2025-03-16 19:57:18,876 INFO L226 Difference]: Without dead ends: 13971 [2025-03-16 19:57:18,899 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 19:57:18,899 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 0 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12655 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12655 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13971 states. [2025-03-16 19:57:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13971 to 13971. [2025-03-16 19:57:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 12364 states have (on average 1.5982691685538661) internal successors, (19761), 12791 states have internal predecessors, (19761), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:57:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 23346 transitions. [2025-03-16 19:57:19,376 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 23346 transitions. Word has length 82 [2025-03-16 19:57:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:19,377 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 23346 transitions. [2025-03-16 19:57:19,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 23346 transitions. [2025-03-16 19:57:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:19,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:19,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:57:19,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:19,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash -621235508, now seen corresponding path program 1 times [2025-03-16 19:57:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716260337] [2025-03-16 19:57:19,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:19,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:19,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:19,427 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 19:57:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716260337] [2025-03-16 19:57:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716260337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:19,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087379927] [2025-03-16 19:57:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:19,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:19,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:19,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:19,429 INFO L87 Difference]: Start difference. First operand 13971 states and 23346 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:19,844 INFO L93 Difference]: Finished difference Result 25876 states and 43198 transitions. [2025-03-16 19:57:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:19,895 INFO L225 Difference]: With dead ends: 25876 [2025-03-16 19:57:19,895 INFO L226 Difference]: Without dead ends: 14037 [2025-03-16 19:57:19,922 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 19:57:19,923 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 0 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12655 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:19,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12655 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2025-03-16 19:57:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 14037. [2025-03-16 19:57:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14037 states, 12430 states have (on average 1.5924376508447304) internal successors, (19794), 12857 states have internal predecessors, (19794), 785 states have call successors, (785), 397 states have call predecessors, (785), 820 states have return successors, (2800), 814 states have call predecessors, (2800), 783 states have call successors, (2800) [2025-03-16 19:57:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14037 states to 14037 states and 23379 transitions. [2025-03-16 19:57:20,566 INFO L78 Accepts]: Start accepts. Automaton has 14037 states and 23379 transitions. Word has length 82 [2025-03-16 19:57:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:20,567 INFO L471 AbstractCegarLoop]: Abstraction has 14037 states and 23379 transitions. [2025-03-16 19:57:20,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 19:57:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14037 states and 23379 transitions. [2025-03-16 19:57:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:57:20,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:20,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:20,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:57:20,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1349703949, now seen corresponding path program 1 times [2025-03-16 19:57:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976053103] [2025-03-16 19:57:20,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:20,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:57:20,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:57:20,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:20,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:20,632 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 19:57:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976053103] [2025-03-16 19:57:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976053103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920488534] [2025-03-16 19:57:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:20,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:20,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:20,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:20,634 INFO L87 Difference]: Start difference. First operand 14037 states and 23379 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:23,052 INFO L93 Difference]: Finished difference Result 70642 states and 117782 transitions. [2025-03-16 19:57:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:57:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 82 [2025-03-16 19:57:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:23,479 INFO L225 Difference]: With dead ends: 70642 [2025-03-16 19:57:23,479 INFO L226 Difference]: Without dead ends: 58737 [2025-03-16 19:57:23,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:57:23,519 INFO L435 NwaCegarLoop]: 4418 mSDtfsCounter, 9079 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9079 SdHoareTripleChecker+Valid, 8993 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:23,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9079 Valid, 8993 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58737 states. [2025-03-16 19:57:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58737 to 58139. [2025-03-16 19:57:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58139 states, 50334 states have (on average 1.5365359399213256) internal successors, (77340), 52655 states have internal predecessors, (77340), 3703 states have call successors, (3703), 1981 states have call predecessors, (3703), 4100 states have return successors, (15062), 3534 states have call predecessors, (15062), 3701 states have call successors, (15062) [2025-03-16 19:57:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58139 states to 58139 states and 96105 transitions. [2025-03-16 19:57:26,702 INFO L78 Accepts]: Start accepts. Automaton has 58139 states and 96105 transitions. Word has length 82 [2025-03-16 19:57:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:26,702 INFO L471 AbstractCegarLoop]: Abstraction has 58139 states and 96105 transitions. [2025-03-16 19:57:26,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 19:57:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58139 states and 96105 transitions. [2025-03-16 19:57:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:57:26,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:26,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:57:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:57:26,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -997779857, now seen corresponding path program 1 times [2025-03-16 19:57:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189144282] [2025-03-16 19:57:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:26,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:57:26,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:57:26,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 19:57:26,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189144282] [2025-03-16 19:57:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189144282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:57:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065217470] [2025-03-16 19:57:26,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:26,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:57:26,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:26,844 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 19:57:26,846 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 19:57:26,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:57:26,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:57:26,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:26,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:26,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:57:26,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:57:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:57:27,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:57:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065217470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:57:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:57:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871067873] [2025-03-16 19:57:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:27,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:27,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:27,034 INFO L87 Difference]: Start difference. First operand 58139 states and 96105 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 19:57:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:31,720 INFO L93 Difference]: Finished difference Result 168502 states and 280278 transitions. [2025-03-16 19:57:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:57:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 132 [2025-03-16 19:57:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:32,293 INFO L225 Difference]: With dead ends: 168502 [2025-03-16 19:57:32,294 INFO L226 Difference]: Without dead ends: 112495 [2025-03-16 19:57:32,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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 19:57:32,478 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 4455 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 19:57:32,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 4455 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112495 states. [2025-03-16 19:57:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112495 to 112161. [2025-03-16 19:57:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112161 states, 96889 states have (on average 1.528223018092869) internal successors, (148068), 101528 states have internal predecessors, (148068), 7070 states have call successors, (7070), 3961 states have call predecessors, (7070), 8200 states have return successors, (29495), 6703 states have call predecessors, (29495), 7068 states have call successors, (29495) [2025-03-16 19:57:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112161 states to 112161 states and 184633 transitions. [2025-03-16 19:57:38,417 INFO L78 Accepts]: Start accepts. Automaton has 112161 states and 184633 transitions. Word has length 132 [2025-03-16 19:57:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:38,417 INFO L471 AbstractCegarLoop]: Abstraction has 112161 states and 184633 transitions. [2025-03-16 19:57:38,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 19:57:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 112161 states and 184633 transitions. [2025-03-16 19:57:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:57:38,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:38,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:57:38,489 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 19:57:38,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 19:57:38,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:38,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash 385982223, now seen corresponding path program 1 times [2025-03-16 19:57:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852109280] [2025-03-16 19:57:38,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:38,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:57:38,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:57:38,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:38,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 19:57:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852109280] [2025-03-16 19:57:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852109280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:57:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455656272] [2025-03-16 19:57:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:38,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:57:38,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:38,743 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 19:57:38,745 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 19:57:38,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:57:38,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:57:38,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:38,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:38,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:57:38,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:57:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:57:38,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:57:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455656272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:57:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:57:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982661990] [2025-03-16 19:57:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:38,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:38,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:38,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:38,897 INFO L87 Difference]: Start difference. First operand 112161 states and 184633 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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)