./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.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 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:40:43,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:40:43,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:40:43,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:40:43,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:40:43,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:40:43,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:40:43,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:40:43,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:40:43,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:40:43,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:40:43,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:40:43,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:40:43,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:40:43,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:40:43,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:40:43,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:40:43,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:40:43,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:40:43,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:40:43,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:40:43,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:40:43,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:40:43,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:40:43,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:40:43,747 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 -> 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d [2025-03-03 15:40:43,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:40:43,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:40:43,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:40:43,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:40:43,996 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:40:43,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2025-03-03 15:40:45,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fabcdf77/40433842e001458aa1e27aef07674101/FLAG39c2e512e [2025-03-03 15:40:45,758 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:40:45,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2025-03-03 15:40:45,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fabcdf77/40433842e001458aa1e27aef07674101/FLAG39c2e512e [2025-03-03 15:40:45,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fabcdf77/40433842e001458aa1e27aef07674101 [2025-03-03 15:40:45,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:40:45,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:40:45,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:40:45,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:40:45,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:40:45,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:40:45" (1/1) ... [2025-03-03 15:40:45,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff2f326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:45, skipping insertion in model container [2025-03-03 15:40:45,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:40:45" (1/1) ... [2025-03-03 15:40:45,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:40:47,045 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_label43+token_ring.10.cil-2.c[381679,381692] [2025-03-03 15:40:47,069 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_label43+token_ring.10.cil-2.c[383339,383352] [2025-03-03 15:40:47,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:40:47,295 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:40:47,787 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_label43+token_ring.10.cil-2.c[381679,381692] [2025-03-03 15:40:47,791 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_label43+token_ring.10.cil-2.c[383339,383352] [2025-03-03 15:40:47,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:40:47,859 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:40:47,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47 WrapperNode [2025-03-03 15:40:47,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:40:47,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:40:47,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:40:47,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:40:47,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:47,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,309 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-03-03 15:40:48,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:40:48,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:40:48,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:40:48,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:40:48,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:40:48,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:40:48,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:40:48,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:40:48,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:40:48,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (1/1) ... [2025-03-03 15:40:48,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:40:48,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:48,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:40:48,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:40:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:40:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:40:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:40:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:40:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:40:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:40:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:40:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:40:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:40:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:40:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:40:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:40:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:40:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:40:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:40:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:40:48,794 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:40:48,795 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:40:54,893 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:40:54,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:40:54,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:40:54,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:40:54,895 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:40:54,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:40:54,896 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:40:55,170 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-03-03 15:40:55,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:40:55,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:40:55,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:40:55,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:40:55 BoogieIcfgContainer [2025-03-03 15:40:55,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:40:55,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:40:55,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:40:55,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:40:55,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:40:45" (1/3) ... [2025-03-03 15:40:55,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ab8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:40:55, skipping insertion in model container [2025-03-03 15:40:55,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:40:47" (2/3) ... [2025-03-03 15:40:55,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378ab8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:40:55, skipping insertion in model container [2025-03-03 15:40:55,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:40:55" (3/3) ... [2025-03-03 15:40:55,243 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.10.cil-2.c [2025-03-03 15:40:55,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:40:55,257 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.10.cil-2.c that has 7 procedures, 2537 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-03-03 15:40:55,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:40:55,349 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;@428a3103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:40:55,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:40:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 15:40:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:40:55,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:55,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:55,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:55,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 490995444, now seen corresponding path program 1 times [2025-03-03 15:40:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147866944] [2025-03-03 15:40:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:55,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:40:55,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:40:55,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:55,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147866944] [2025-03-03 15:40:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147866944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:55,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:55,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:55,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006452326] [2025-03-03 15:40:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:55,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:55,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:55,979 INFO L87 Difference]: Start difference. First operand has 2537 states, 2504 states have (on average 1.832667731629393) internal successors, (4589), 2507 states have internal predecessors, (4589), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:56,722 INFO L93 Difference]: Finished difference Result 5430 states and 9845 transitions. [2025-03-03 15:40:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:40:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:40:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:56,750 INFO L225 Difference]: With dead ends: 5430 [2025-03-03 15:40:56,750 INFO L226 Difference]: Without dead ends: 2841 [2025-03-03 15:40:56,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:56,758 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5028 mSDsluCounter, 9139 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 13587 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 13587 Invalid, 602 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-03-03 15:40:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2816. [2025-03-03 15:40:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7915155910079767) internal successors, (4941), 2761 states have internal predecessors, (4941), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-03 15:40:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5028 transitions. [2025-03-03 15:40:56,895 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5028 transitions. Word has length 156 [2025-03-03 15:40:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5028 transitions. [2025-03-03 15:40:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5028 transitions. [2025-03-03 15:40:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:40:56,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:56,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:56,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:40:56,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1402295606, now seen corresponding path program 1 times [2025-03-03 15:40:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040429762] [2025-03-03 15:40:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:56,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:40:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:40:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040429762] [2025-03-03 15:40:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040429762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:40:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206351462] [2025-03-03 15:40:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:57,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:40:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:57,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:40:57,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:40:57,103 INFO L87 Difference]: Start difference. First operand 2816 states and 5028 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:57,458 INFO L93 Difference]: Finished difference Result 3559 states and 6197 transitions. [2025-03-03 15:40:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:40:57,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:40:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:57,469 INFO L225 Difference]: With dead ends: 3559 [2025-03-03 15:40:57,470 INFO L226 Difference]: Without dead ends: 2882 [2025-03-03 15:40:57,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:57,473 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4675 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 12966 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:57,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 12966 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:40:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-03 15:40:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2816. [2025-03-03 15:40:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2758 states have (on average 1.7907904278462654) internal successors, (4939), 2761 states have internal predecessors, (4939), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-03 15:40:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 5026 transitions. [2025-03-03 15:40:57,548 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 5026 transitions. Word has length 156 [2025-03-03 15:40:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:57,548 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 5026 transitions. [2025-03-03 15:40:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 5026 transitions. [2025-03-03 15:40:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:40:57,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:57,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:57,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:40:57,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1553908267, now seen corresponding path program 1 times [2025-03-03 15:40:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222733438] [2025-03-03 15:40:57,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:57,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:57,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:40:57,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:40:57,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:57,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222733438] [2025-03-03 15:40:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222733438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414557160] [2025-03-03 15:40:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:57,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:57,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:57,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:57,776 INFO L87 Difference]: Start difference. First operand 2816 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:58,634 INFO L93 Difference]: Finished difference Result 3924 states and 6758 transitions. [2025-03-03 15:40:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:40:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:58,647 INFO L225 Difference]: With dead ends: 3924 [2025-03-03 15:40:58,648 INFO L226 Difference]: Without dead ends: 3247 [2025-03-03 15:40:58,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:58,652 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 4959 mSDsluCounter, 14059 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 18725 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:58,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 18725 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:40:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-03-03 15:40:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 3138. [2025-03-03 15:40:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 3054 states have (on average 1.7635887360838245) internal successors, (5386), 3058 states have internal predecessors, (5386), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-03-03 15:40:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5514 transitions. [2025-03-03 15:40:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5514 transitions. Word has length 156 [2025-03-03 15:40:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5514 transitions. [2025-03-03 15:40:58,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5514 transitions. [2025-03-03 15:40:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:40:58,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:58,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:58,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:40:58,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:58,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1372175018, now seen corresponding path program 1 times [2025-03-03 15:40:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870845660] [2025-03-03 15:40:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:40:58,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:40:58,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:58,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870845660] [2025-03-03 15:40:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870845660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247624103] [2025-03-03 15:40:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:58,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:58,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:58,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:58,924 INFO L87 Difference]: Start difference. First operand 3138 states and 5514 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:59,586 INFO L93 Difference]: Finished difference Result 4945 states and 8331 transitions. [2025-03-03 15:40:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:40:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:40:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:59,608 INFO L225 Difference]: With dead ends: 4945 [2025-03-03 15:40:59,608 INFO L226 Difference]: Without dead ends: 3946 [2025-03-03 15:40:59,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:40:59,615 INFO L435 NwaCegarLoop]: 4409 mSDtfsCounter, 4982 mSDsluCounter, 13431 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 17840 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:59,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5000 Valid, 17840 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:40:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2025-03-03 15:40:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3821. [2025-03-03 15:40:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3683 states have (on average 1.7244094488188977) internal successors, (6351), 3691 states have internal predecessors, (6351), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-03-03 15:40:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6567 transitions. [2025-03-03 15:40:59,746 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6567 transitions. Word has length 156 [2025-03-03 15:40:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:59,747 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6567 transitions. [2025-03-03 15:40:59,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:40:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6567 transitions. [2025-03-03 15:40:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:40:59,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:59,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:40:59,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1227765323, now seen corresponding path program 1 times [2025-03-03 15:40:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448761394] [2025-03-03 15:40:59,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:59,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:40:59,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:40:59,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:59,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:40:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448761394] [2025-03-03 15:40:59,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448761394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:59,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:40:59,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:40:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565334781] [2025-03-03 15:40:59,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:59,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:40:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:59,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:40:59,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:59,932 INFO L87 Difference]: Start difference. First operand 3821 states and 6567 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:00,689 INFO L93 Difference]: Finished difference Result 7138 states and 11782 transitions. [2025-03-03 15:41:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:00,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:00,711 INFO L225 Difference]: With dead ends: 7138 [2025-03-03 15:41:00,711 INFO L226 Difference]: Without dead ends: 5456 [2025-03-03 15:41:00,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:00,719 INFO L435 NwaCegarLoop]: 4659 mSDtfsCounter, 4949 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4967 SdHoareTripleChecker+Valid, 18697 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:00,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4967 Valid, 18697 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:41:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-03-03 15:41:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5298. [2025-03-03 15:41:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5046 states have (on average 1.6811335711454618) internal successors, (8483), 5068 states have internal predecessors, (8483), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-03 15:41:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 8899 transitions. [2025-03-03 15:41:00,868 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 8899 transitions. Word has length 156 [2025-03-03 15:41:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:00,868 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 8899 transitions. [2025-03-03 15:41:00,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 8899 transitions. [2025-03-03 15:41:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:00,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:00,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:41:00,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1500201610, now seen corresponding path program 1 times [2025-03-03 15:41:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446501065] [2025-03-03 15:41:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:00,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:00,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:00,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:00,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446501065] [2025-03-03 15:41:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446501065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:01,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:01,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978289082] [2025-03-03 15:41:01,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:01,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:01,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:01,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:01,013 INFO L87 Difference]: Start difference. First operand 5298 states and 8899 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:01,799 INFO L93 Difference]: Finished difference Result 11949 states and 19576 transitions. [2025-03-03 15:41:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:01,840 INFO L225 Difference]: With dead ends: 11949 [2025-03-03 15:41:01,840 INFO L226 Difference]: Without dead ends: 8790 [2025-03-03 15:41:01,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:01,852 INFO L435 NwaCegarLoop]: 4656 mSDtfsCounter, 4944 mSDsluCounter, 14029 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4962 SdHoareTripleChecker+Valid, 18685 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:01,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4962 Valid, 18685 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:41:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2025-03-03 15:41:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8567. [2025-03-03 15:41:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8567 states, 8069 states have (on average 1.6506382451357045) internal successors, (13319), 8137 states have internal predecessors, (13319), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-03-03 15:41:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8567 states to 8567 states and 14231 transitions. [2025-03-03 15:41:02,081 INFO L78 Accepts]: Start accepts. Automaton has 8567 states and 14231 transitions. Word has length 156 [2025-03-03 15:41:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 8567 states and 14231 transitions. [2025-03-03 15:41:02,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 8567 states and 14231 transitions. [2025-03-03 15:41:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:02,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:02,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:02,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:41:02,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:02,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 984862101, now seen corresponding path program 1 times [2025-03-03 15:41:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585115614] [2025-03-03 15:41:02,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:02,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:02,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:02,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:02,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585115614] [2025-03-03 15:41:02,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585115614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:02,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:02,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764101824] [2025-03-03 15:41:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:02,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:02,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:02,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:02,212 INFO L87 Difference]: Start difference. First operand 8567 states and 14231 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:02,964 INFO L93 Difference]: Finished difference Result 22772 states and 37818 transitions. [2025-03-03 15:41:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:03,010 INFO L225 Difference]: With dead ends: 22772 [2025-03-03 15:41:03,011 INFO L226 Difference]: Without dead ends: 16344 [2025-03-03 15:41:03,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:03,034 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 4939 mSDsluCounter, 14020 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4957 SdHoareTripleChecker+Valid, 18673 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:03,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4957 Valid, 18673 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:41:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2025-03-03 15:41:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 15996. [2025-03-03 15:41:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6454654895666132) internal successors, (24603), 15166 states have internal predecessors, (24603), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-03 15:41:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26891 transitions. [2025-03-03 15:41:03,489 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26891 transitions. Word has length 156 [2025-03-03 15:41:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26891 transitions. [2025-03-03 15:41:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26891 transitions. [2025-03-03 15:41:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:03,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:03,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:41:03,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 510836118, now seen corresponding path program 1 times [2025-03-03 15:41:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301529809] [2025-03-03 15:41:03,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:03,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:03,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:03,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:03,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:03,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301529809] [2025-03-03 15:41:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301529809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832022209] [2025-03-03 15:41:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:03,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:03,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:03,610 INFO L87 Difference]: Start difference. First operand 15996 states and 26891 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:04,218 INFO L93 Difference]: Finished difference Result 33773 states and 57990 transitions. [2025-03-03 15:41:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:04,272 INFO L225 Difference]: With dead ends: 33773 [2025-03-03 15:41:04,272 INFO L226 Difference]: Without dead ends: 19916 [2025-03-03 15:41:04,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:04,301 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4667 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12928 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:04,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 12928 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19916 states. [2025-03-03 15:41:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19916 to 15996. [2025-03-03 15:41:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6432584269662922) internal successors, (24570), 15166 states have internal predecessors, (24570), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-03 15:41:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26858 transitions. [2025-03-03 15:41:04,728 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26858 transitions. Word has length 156 [2025-03-03 15:41:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26858 transitions. [2025-03-03 15:41:04,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26858 transitions. [2025-03-03 15:41:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:04,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:04,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:04,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:41:04,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:04,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 218450293, now seen corresponding path program 1 times [2025-03-03 15:41:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358670620] [2025-03-03 15:41:04,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:04,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:04,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:04,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:04,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358670620] [2025-03-03 15:41:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358670620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:04,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:04,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594579078] [2025-03-03 15:41:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:04,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:04,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:04,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:04,824 INFO L87 Difference]: Start difference. First operand 15996 states and 26858 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:05,593 INFO L93 Difference]: Finished difference Result 33528 states and 57434 transitions. [2025-03-03 15:41:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:05,667 INFO L225 Difference]: With dead ends: 33528 [2025-03-03 15:41:05,668 INFO L226 Difference]: Without dead ends: 19671 [2025-03-03 15:41:05,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:05,711 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4664 mSDsluCounter, 8569 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:05,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 12920 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2025-03-03 15:41:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 15996. [2025-03-03 15:41:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 14952 states have (on average 1.6410513643659712) internal successors, (24537), 15166 states have internal predecessors, (24537), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-03 15:41:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 26825 transitions. [2025-03-03 15:41:06,267 INFO L78 Accepts]: Start accepts. Automaton has 15996 states and 26825 transitions. Word has length 156 [2025-03-03 15:41:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:06,267 INFO L471 AbstractCegarLoop]: Abstraction has 15996 states and 26825 transitions. [2025-03-03 15:41:06,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15996 states and 26825 transitions. [2025-03-03 15:41:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:06,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:06,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:06,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:41:06,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:06,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2146286154, now seen corresponding path program 1 times [2025-03-03 15:41:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409300264] [2025-03-03 15:41:06,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:06,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:06,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409300264] [2025-03-03 15:41:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409300264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:06,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814057723] [2025-03-03 15:41:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:06,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:06,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:06,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:06,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:06,392 INFO L87 Difference]: Start difference. First operand 15996 states and 26825 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:07,460 INFO L93 Difference]: Finished difference Result 47251 states and 81018 transitions. [2025-03-03 15:41:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:07,582 INFO L225 Difference]: With dead ends: 47251 [2025-03-03 15:41:07,582 INFO L226 Difference]: Without dead ends: 33394 [2025-03-03 15:41:07,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:07,631 INFO L435 NwaCegarLoop]: 4640 mSDtfsCounter, 4918 mSDsluCounter, 13983 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18623 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:07,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18623 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:41:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33394 states. [2025-03-03 15:41:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33394 to 32879. [2025-03-03 15:41:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.6542624505411858) internal successors, (50589), 31249 states have internal predecessors, (50589), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-03 15:41:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57165 transitions. [2025-03-03 15:41:08,568 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57165 transitions. Word has length 156 [2025-03-03 15:41:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:08,568 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57165 transitions. [2025-03-03 15:41:08,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57165 transitions. [2025-03-03 15:41:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:08,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:08,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:08,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:41:08,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1933851989, now seen corresponding path program 1 times [2025-03-03 15:41:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085358359] [2025-03-03 15:41:08,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:08,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:08,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:08,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:08,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085358359] [2025-03-03 15:41:08,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085358359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:08,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:08,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901650922] [2025-03-03 15:41:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:08,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:08,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:08,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:08,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:08,668 INFO L87 Difference]: Start difference. First operand 32879 states and 57165 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:09,815 INFO L93 Difference]: Finished difference Result 73122 states and 131382 transitions. [2025-03-03 15:41:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:09,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:09,961 INFO L225 Difference]: With dead ends: 73122 [2025-03-03 15:41:09,962 INFO L226 Difference]: Without dead ends: 42382 [2025-03-03 15:41:10,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:10,048 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4660 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 12906 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:10,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 12906 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2025-03-03 15:41:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 32879. [2025-03-03 15:41:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32879 states, 30581 states have (on average 1.652136947778032) internal successors, (50524), 31249 states have internal predecessors, (50524), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 1056 states have return successors, (5336), 1303 states have call predecessors, (5336), 1240 states have call successors, (5336) [2025-03-03 15:41:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32879 states to 32879 states and 57100 transitions. [2025-03-03 15:41:12,020 INFO L78 Accepts]: Start accepts. Automaton has 32879 states and 57100 transitions. Word has length 156 [2025-03-03 15:41:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 32879 states and 57100 transitions. [2025-03-03 15:41:12,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 32879 states and 57100 transitions. [2025-03-03 15:41:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:12,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:12,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:12,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:41:12,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:12,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -566929962, now seen corresponding path program 1 times [2025-03-03 15:41:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084115072] [2025-03-03 15:41:12,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:12,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:12,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:12,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084115072] [2025-03-03 15:41:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084115072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248265414] [2025-03-03 15:41:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:12,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:12,149 INFO L87 Difference]: Start difference. First operand 32879 states and 57100 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:14,609 INFO L93 Difference]: Finished difference Result 108360 states and 195178 transitions. [2025-03-03 15:41:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:14,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:14,869 INFO L225 Difference]: With dead ends: 108360 [2025-03-03 15:41:14,870 INFO L226 Difference]: Without dead ends: 77620 [2025-03-03 15:41:14,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:14,956 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 5258 mSDsluCounter, 13365 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:14,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 17756 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:41:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77620 states. [2025-03-03 15:41:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77620 to 71799. [2025-03-03 15:41:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.6769764612218534) internal successors, (111638), 68633 states have internal predecessors, (111638), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-03 15:41:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132806 transitions. [2025-03-03 15:41:17,614 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132806 transitions. Word has length 156 [2025-03-03 15:41:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:17,614 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132806 transitions. [2025-03-03 15:41:17,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132806 transitions. [2025-03-03 15:41:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:17,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:17,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:41:17,631 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash -93411019, now seen corresponding path program 1 times [2025-03-03 15:41:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944408407] [2025-03-03 15:41:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:17,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:17,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:17,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944408407] [2025-03-03 15:41:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944408407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:17,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529167198] [2025-03-03 15:41:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:17,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:17,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:17,703 INFO L87 Difference]: Start difference. First operand 71799 states and 132806 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:21,530 INFO L93 Difference]: Finished difference Result 165538 states and 319858 transitions. [2025-03-03 15:41:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:21,994 INFO L225 Difference]: With dead ends: 165538 [2025-03-03 15:41:21,995 INFO L226 Difference]: Without dead ends: 95878 [2025-03-03 15:41:22,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:22,117 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4654 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 12890 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:22,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 12890 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95878 states. [2025-03-03 15:41:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95878 to 71799. [2025-03-03 15:41:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71799 states, 66571 states have (on average 1.675038680506527) internal successors, (111509), 68633 states have internal predecessors, (111509), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 2834 states have return successors, (18776), 2519 states have call predecessors, (18776), 2392 states have call successors, (18776) [2025-03-03 15:41:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71799 states to 71799 states and 132677 transitions. [2025-03-03 15:41:27,117 INFO L78 Accepts]: Start accepts. Automaton has 71799 states and 132677 transitions. Word has length 156 [2025-03-03 15:41:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:27,117 INFO L471 AbstractCegarLoop]: Abstraction has 71799 states and 132677 transitions. [2025-03-03 15:41:27,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 71799 states and 132677 transitions. [2025-03-03 15:41:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:41:27,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:27,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:41:27,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:27,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 337505782, now seen corresponding path program 1 times [2025-03-03 15:41:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372009945] [2025-03-03 15:41:27,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:27,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:41:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:41:27,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:27,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:41:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372009945] [2025-03-03 15:41:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372009945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:27,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:27,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79252346] [2025-03-03 15:41:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:27,209 INFO L87 Difference]: Start difference. First operand 71799 states and 132677 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:41:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:32,575 INFO L93 Difference]: Finished difference Result 241756 states and 474039 transitions. [2025-03-03 15:41:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 15:41:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:33,341 INFO L225 Difference]: With dead ends: 241756 [2025-03-03 15:41:33,341 INFO L226 Difference]: Without dead ends: 172096 [2025-03-03 15:41:33,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:33,592 INFO L435 NwaCegarLoop]: 4622 mSDtfsCounter, 5146 mSDsluCounter, 13926 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5175 SdHoareTripleChecker+Valid, 18548 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:33,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5175 Valid, 18548 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:41:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172096 states.