./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae9f818c1f032966d67b2bd4627e73bc680f5fe59ca24bfc7cff4e83563ff8e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:06:46,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:06:46,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:06:46,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:06:46,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:06:46,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:06:46,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:06:46,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:06:46,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:06:46,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:06:46,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:06:46,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:06:46,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:06:46,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:06:46,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:06:46,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:06:46,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:06:46,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:06:46,110 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae9f818c1f032966d67b2bd4627e73bc680f5fe59ca24bfc7cff4e83563ff8e3 [2025-02-05 17:06:46,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:06:46,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:06:46,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:06:46,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:06:46,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:06:46,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c [2025-02-05 17:06:47,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f909c73e9/ceb46174bf1b49cb8e82d85e1d14d9fa/FLAG356e85e1a [2025-02-05 17:06:48,426 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:06:48,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c [2025-02-05 17:06:48,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f909c73e9/ceb46174bf1b49cb8e82d85e1d14d9fa/FLAG356e85e1a [2025-02-05 17:06:48,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f909c73e9/ceb46174bf1b49cb8e82d85e1d14d9fa [2025-02-05 17:06:48,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:06:48,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:06:48,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:06:48,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:06:48,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:06:48,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:06:48" (1/1) ... [2025-02-05 17:06:48,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b82819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:48, skipping insertion in model container [2025-02-05 17:06:48,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:06:48" (1/1) ... [2025-02-05 17:06:48,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:06:49,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[376251,376264] [2025-02-05 17:06:49,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:06:50,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:06:50,210 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:06:50,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[376251,376264] [2025-02-05 17:06:50,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:06:50,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:06:50,907 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:06:50,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50 WrapperNode [2025-02-05 17:06:50,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:06:50,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:06:50,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:06:50,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:06:50,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:50,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,331 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-02-05 17:06:51,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:06:51,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:06:51,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:06:51,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:06:51,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,438 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:06:51,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:06:51,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:06:51,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:06:51,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:06:51,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (1/1) ... [2025-02-05 17:06:51,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:06:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:06:51,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:06:51,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:06:51,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:06:51,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:06:52,045 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:06:52,047 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:06:58,467 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:06:58,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:06:58,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:06:58,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:06:58,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:06:58,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:06:58,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:06:58,785 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-02-05 17:06:58,785 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:06:58,835 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:06:58,838 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:06:58,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:06:58 BoogieIcfgContainer [2025-02-05 17:06:58,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:06:58,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:06:58,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:06:58,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:06:58,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:06:48" (1/3) ... [2025-02-05 17:06:58,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aae3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:06:58, skipping insertion in model container [2025-02-05 17:06:58,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:06:50" (2/3) ... [2025-02-05 17:06:58,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aae3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:06:58, skipping insertion in model container [2025-02-05 17:06:58,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:06:58" (3/3) ... [2025-02-05 17:06:58,847 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.11.cil-2.c [2025-02-05 17:06:58,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:06:58,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.11.cil-2.c that has 7 procedures, 2564 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-02-05 17:06:58,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:06:58,940 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;@1d4ca757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:06:58,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:06:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:06:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:06:58,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:58,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:06:58,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:58,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1808491916, now seen corresponding path program 1 times [2025-02-05 17:06:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136537360] [2025-02-05 17:06:58,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:06:59,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:06:59,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:59,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136537360] [2025-02-05 17:06:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136537360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:59,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996746598] [2025-02-05 17:06:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:59,540 INFO L87 Difference]: Start difference. First operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:00,413 INFO L93 Difference]: Finished difference Result 5513 states and 9981 transitions. [2025-02-05 17:07:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:07:00,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:00,436 INFO L225 Difference]: With dead ends: 5513 [2025-02-05 17:07:00,436 INFO L226 Difference]: Without dead ends: 2898 [2025-02-05 17:07:00,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:00,446 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 5115 mSDsluCounter, 9229 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 13711 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:00,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 13711 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:07:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-02-05 17:07:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2871. [2025-02-05 17:07:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7876200640341515) internal successors, (5025), 2814 states have internal predecessors, (5025), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:07:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5116 transitions. [2025-02-05 17:07:00,583 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5116 transitions. Word has length 167 [2025-02-05 17:07:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:00,583 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5116 transitions. [2025-02-05 17:07:00,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5116 transitions. [2025-02-05 17:07:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:00,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:00,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:00,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:07:00,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1308698826, now seen corresponding path program 1 times [2025-02-05 17:07:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:00,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886829945] [2025-02-05 17:07:00,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:00,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:00,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:00,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:00,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-02-05 17:07:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886829945] [2025-02-05 17:07:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886829945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:00,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:00,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008014831] [2025-02-05 17:07:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:00,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:00,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:00,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:00,824 INFO L87 Difference]: Start difference. First operand 2871 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:01,312 INFO L93 Difference]: Finished difference Result 3674 states and 6383 transitions. [2025-02-05 17:07:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:01,330 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 17:07:01,330 INFO L226 Difference]: Without dead ends: 2943 [2025-02-05 17:07:01,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:01,333 INFO L435 NwaCegarLoop]: 4401 mSDtfsCounter, 4736 mSDsluCounter, 8657 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:01,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 13058 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-02-05 17:07:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2871. [2025-02-05 17:07:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7869085734614016) internal successors, (5023), 2814 states have internal predecessors, (5023), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:07:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5114 transitions. [2025-02-05 17:07:01,394 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5114 transitions. Word has length 167 [2025-02-05 17:07:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:01,395 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5114 transitions. [2025-02-05 17:07:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5114 transitions. [2025-02-05 17:07:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:01,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:01,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:01,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:07:01,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:01,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1139555051, now seen corresponding path program 1 times [2025-02-05 17:07:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653263922] [2025-02-05 17:07:01,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:01,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:01,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:01,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:01,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653263922] [2025-02-05 17:07:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653263922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978889124] [2025-02-05 17:07:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:01,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:01,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:01,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:01,550 INFO L87 Difference]: Start difference. First operand 2871 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:02,245 INFO L93 Difference]: Finished difference Result 4069 states and 6993 transitions. [2025-02-05 17:07:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:02,256 INFO L225 Difference]: With dead ends: 4069 [2025-02-05 17:07:02,256 INFO L226 Difference]: Without dead ends: 3338 [2025-02-05 17:07:02,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:02,259 INFO L435 NwaCegarLoop]: 4725 mSDtfsCounter, 5048 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:02,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 18972 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-02-05 17:07:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3219. [2025-02-05 17:07:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3132 states have (on average 1.7589399744572158) internal successors, (5509), 3136 states have internal predecessors, (5509), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:07:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5643 transitions. [2025-02-05 17:07:02,343 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5643 transitions. Word has length 167 [2025-02-05 17:07:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:02,344 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5643 transitions. [2025-02-05 17:07:02,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5643 transitions. [2025-02-05 17:07:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:02,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:02,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:02,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:07:02,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1221205846, now seen corresponding path program 1 times [2025-02-05 17:07:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160722323] [2025-02-05 17:07:02,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:02,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:02,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160722323] [2025-02-05 17:07:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160722323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291238032] [2025-02-05 17:07:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:02,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:02,602 INFO L87 Difference]: Start difference. First operand 3219 states and 5643 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:03,562 INFO L93 Difference]: Finished difference Result 5174 states and 8701 transitions. [2025-02-05 17:07:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:03,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:03,580 INFO L225 Difference]: With dead ends: 5174 [2025-02-05 17:07:03,580 INFO L226 Difference]: Without dead ends: 4095 [2025-02-05 17:07:03,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:03,585 INFO L435 NwaCegarLoop]: 4721 mSDtfsCounter, 5043 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 18956 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:03,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 18956 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:07:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-02-05 17:07:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3958. [2025-02-05 17:07:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3815 states have (on average 1.7195281782437746) internal successors, (6560), 3823 states have internal predecessors, (6560), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:07:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6786 transitions. [2025-02-05 17:07:03,680 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6786 transitions. Word has length 167 [2025-02-05 17:07:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6786 transitions. [2025-02-05 17:07:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6786 transitions. [2025-02-05 17:07:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:03,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:03,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:07:03,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1196492555, now seen corresponding path program 1 times [2025-02-05 17:07:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197838814] [2025-02-05 17:07:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:03,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197838814] [2025-02-05 17:07:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197838814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:03,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133316081] [2025-02-05 17:07:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:03,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:03,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:03,818 INFO L87 Difference]: Start difference. First operand 3958 states and 6786 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:04,541 INFO L93 Difference]: Finished difference Result 7551 states and 12454 transitions. [2025-02-05 17:07:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:04,561 INFO L225 Difference]: With dead ends: 7551 [2025-02-05 17:07:04,562 INFO L226 Difference]: Without dead ends: 5733 [2025-02-05 17:07:04,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:04,566 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5038 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 18944 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:04,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 18944 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:07:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-02-05 17:07:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5559. [2025-02-05 17:07:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 5298 states have (on average 1.6776141940354852) internal successors, (8888), 5320 states have internal predecessors, (8888), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:07:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9322 transitions. [2025-02-05 17:07:04,695 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9322 transitions. Word has length 167 [2025-02-05 17:07:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:04,695 INFO L471 AbstractCegarLoop]: Abstraction has 5559 states and 9322 transitions. [2025-02-05 17:07:04,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9322 transitions. [2025-02-05 17:07:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:04,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:04,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:07:04,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1274482826, now seen corresponding path program 1 times [2025-02-05 17:07:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539321102] [2025-02-05 17:07:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:04,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:04,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:04,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:04,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539321102] [2025-02-05 17:07:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539321102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978337895] [2025-02-05 17:07:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:04,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:04,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:04,930 INFO L87 Difference]: Start difference. First operand 5559 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:05,749 INFO L93 Difference]: Finished difference Result 12778 states and 20948 transitions. [2025-02-05 17:07:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:05,778 INFO L225 Difference]: With dead ends: 12778 [2025-02-05 17:07:05,779 INFO L226 Difference]: Without dead ends: 9359 [2025-02-05 17:07:05,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:05,788 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5033 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:05,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 18932 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-02-05 17:07:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9112. [2025-02-05 17:07:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6503431429568454) internal successors, (14188), 8665 states have internal predecessors, (14188), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:07:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15134 transitions. [2025-02-05 17:07:05,983 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15134 transitions. Word has length 167 [2025-02-05 17:07:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:05,984 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15134 transitions. [2025-02-05 17:07:05,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15134 transitions. [2025-02-05 17:07:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:05,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:05,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:05,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:07:05,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:05,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1078306005, now seen corresponding path program 1 times [2025-02-05 17:07:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:05,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053846870] [2025-02-05 17:07:05,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:06,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:06,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:06,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:06,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053846870] [2025-02-05 17:07:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053846870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415475591] [2025-02-05 17:07:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:06,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:06,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:06,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:06,111 INFO L87 Difference]: Start difference. First operand 9112 states and 15134 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:06,816 INFO L93 Difference]: Finished difference Result 17578 states and 29308 transitions. [2025-02-05 17:07:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:06,857 INFO L225 Difference]: With dead ends: 17578 [2025-02-05 17:07:06,857 INFO L226 Difference]: Without dead ends: 10606 [2025-02-05 17:07:06,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:06,876 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4728 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 13020 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:06,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 13020 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2025-02-05 17:07:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 9112. [2025-02-05 17:07:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6483657089682446) internal successors, (14171), 8665 states have internal predecessors, (14171), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:07:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15117 transitions. [2025-02-05 17:07:07,083 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15117 transitions. Word has length 167 [2025-02-05 17:07:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15117 transitions. [2025-02-05 17:07:07,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15117 transitions. [2025-02-05 17:07:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:07,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:07,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:07:07,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2137119244, now seen corresponding path program 1 times [2025-02-05 17:07:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603793341] [2025-02-05 17:07:07,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:07,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:07,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603793341] [2025-02-05 17:07:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603793341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311925024] [2025-02-05 17:07:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:07,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:07,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:07,182 INFO L87 Difference]: Start difference. First operand 9112 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:07,642 INFO L93 Difference]: Finished difference Result 17495 states and 29108 transitions. [2025-02-05 17:07:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:07,670 INFO L225 Difference]: With dead ends: 17495 [2025-02-05 17:07:07,670 INFO L226 Difference]: Without dead ends: 10523 [2025-02-05 17:07:07,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:07,689 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4725 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 13012 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:07,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 13012 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2025-02-05 17:07:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 9112. [2025-02-05 17:07:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6463882749796441) internal successors, (14154), 8665 states have internal predecessors, (14154), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:07:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15100 transitions. [2025-02-05 17:07:08,005 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15100 transitions. Word has length 167 [2025-02-05 17:07:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:08,006 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15100 transitions. [2025-02-05 17:07:08,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15100 transitions. [2025-02-05 17:07:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:08,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:08,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:07:08,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:08,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:08,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2102295307, now seen corresponding path program 1 times [2025-02-05 17:07:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365776133] [2025-02-05 17:07:08,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:08,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365776133] [2025-02-05 17:07:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365776133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742084671] [2025-02-05 17:07:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:08,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:08,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:08,124 INFO L87 Difference]: Start difference. First operand 9112 states and 15100 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:09,191 INFO L93 Difference]: Finished difference Result 24277 states and 40176 transitions. [2025-02-05 17:07:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:09,241 INFO L225 Difference]: With dead ends: 24277 [2025-02-05 17:07:09,241 INFO L226 Difference]: Without dead ends: 17305 [2025-02-05 17:07:09,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:09,265 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5009 mSDsluCounter, 14170 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 18868 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:09,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 18868 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:07:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2025-02-05 17:07:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16974. [2025-02-05 17:07:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6395546329496131) internal successors, (26064), 16111 states have internal predecessors, (26064), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:07:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28418 transitions. [2025-02-05 17:07:09,697 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28418 transitions. Word has length 167 [2025-02-05 17:07:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28418 transitions. [2025-02-05 17:07:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28418 transitions. [2025-02-05 17:07:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:09,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:09,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:09,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:07:09,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 254132692, now seen corresponding path program 1 times [2025-02-05 17:07:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058788616] [2025-02-05 17:07:09,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:09,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:09,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:09,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058788616] [2025-02-05 17:07:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058788616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:09,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778964642] [2025-02-05 17:07:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:09,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:09,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:09,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:09,782 INFO L87 Difference]: Start difference. First operand 16974 states and 28418 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:10,512 INFO L93 Difference]: Finished difference Result 35483 states and 60552 transitions. [2025-02-05 17:07:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:10,574 INFO L225 Difference]: With dead ends: 35483 [2025-02-05 17:07:10,575 INFO L226 Difference]: Without dead ends: 20649 [2025-02-05 17:07:10,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:10,600 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4721 mSDsluCounter, 8618 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 12998 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 12998 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:07:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2025-02-05 17:07:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 16974. [2025-02-05 17:07:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.637478769579166) internal successors, (26031), 16111 states have internal predecessors, (26031), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:07:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28385 transitions. [2025-02-05 17:07:11,220 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28385 transitions. Word has length 167 [2025-02-05 17:07:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:11,221 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28385 transitions. [2025-02-05 17:07:11,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28385 transitions. [2025-02-05 17:07:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:11,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:11,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:11,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:07:11,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:11,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1193874155, now seen corresponding path program 1 times [2025-02-05 17:07:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:11,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303113173] [2025-02-05 17:07:11,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:11,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:11,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:11,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303113173] [2025-02-05 17:07:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303113173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:11,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109598502] [2025-02-05 17:07:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:11,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:11,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:11,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:11,321 INFO L87 Difference]: Start difference. First operand 16974 states and 28385 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:12,280 INFO L93 Difference]: Finished difference Result 35238 states and 59996 transitions. [2025-02-05 17:07:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:12,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:12,397 INFO L225 Difference]: With dead ends: 35238 [2025-02-05 17:07:12,397 INFO L226 Difference]: Without dead ends: 20404 [2025-02-05 17:07:12,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:12,442 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4718 mSDsluCounter, 8613 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12990 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:12,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12990 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2025-02-05 17:07:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 16974. [2025-02-05 17:07:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6354029062087185) internal successors, (25998), 16111 states have internal predecessors, (25998), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:07:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28352 transitions. [2025-02-05 17:07:13,061 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28352 transitions. Word has length 167 [2025-02-05 17:07:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:13,062 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28352 transitions. [2025-02-05 17:07:13,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28352 transitions. [2025-02-05 17:07:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:13,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:13,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:07:13,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash 144889268, now seen corresponding path program 1 times [2025-02-05 17:07:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388045608] [2025-02-05 17:07:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:13,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:13,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:13,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388045608] [2025-02-05 17:07:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388045608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671961576] [2025-02-05 17:07:13,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:13,155 INFO L87 Difference]: Start difference. First operand 16974 states and 28352 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:14,677 INFO L93 Difference]: Finished difference Result 52501 states and 89027 transitions. [2025-02-05 17:07:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:14,922 INFO L225 Difference]: With dead ends: 52501 [2025-02-05 17:07:14,922 INFO L226 Difference]: Without dead ends: 37667 [2025-02-05 17:07:14,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:14,984 INFO L435 NwaCegarLoop]: 4683 mSDtfsCounter, 5332 mSDsluCounter, 14122 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 18805 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:14,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 18805 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:07:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37667 states. [2025-02-05 17:07:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37667 to 34465. [2025-02-05 17:07:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6466670815958175) internal successors, (52914), 32802 states have internal predecessors, (52914), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:07:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59556 transitions. [2025-02-05 17:07:16,255 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59556 transitions. Word has length 167 [2025-02-05 17:07:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59556 transitions. [2025-02-05 17:07:16,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59556 transitions. [2025-02-05 17:07:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:16,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:16,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:16,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:07:16,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:16,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 326622517, now seen corresponding path program 1 times [2025-02-05 17:07:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138046290] [2025-02-05 17:07:16,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:16,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:16,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:16,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-02-05 17:07:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138046290] [2025-02-05 17:07:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138046290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:16,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133834129] [2025-02-05 17:07:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:16,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:16,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:16,393 INFO L87 Difference]: Start difference. First operand 34465 states and 59556 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:18,379 INFO L93 Difference]: Finished difference Result 75562 states and 134700 transitions. [2025-02-05 17:07:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:18,667 INFO L225 Difference]: With dead ends: 75562 [2025-02-05 17:07:18,667 INFO L226 Difference]: Without dead ends: 43237 [2025-02-05 17:07:18,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:18,802 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4712 mSDsluCounter, 8602 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12974 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:18,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12974 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43237 states. [2025-02-05 17:07:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43237 to 34465. [2025-02-05 17:07:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.644644301985436) internal successors, (52849), 32802 states have internal predecessors, (52849), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:07:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59491 transitions. [2025-02-05 17:07:20,866 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59491 transitions. Word has length 167 [2025-02-05 17:07:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:20,866 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59491 transitions. [2025-02-05 17:07:20,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59491 transitions. [2025-02-05 17:07:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:20,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:20,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:20,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:07:20,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:20,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 471032212, now seen corresponding path program 1 times [2025-02-05 17:07:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979205922] [2025-02-05 17:07:20,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:20,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:20,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979205922] [2025-02-05 17:07:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979205922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563042878] [2025-02-05 17:07:21,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:21,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:21,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:21,067 INFO L87 Difference]: Start difference. First operand 34465 states and 59491 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:22,783 INFO L93 Difference]: Finished difference Result 74100 states and 131646 transitions. [2025-02-05 17:07:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:22,901 INFO L225 Difference]: With dead ends: 74100 [2025-02-05 17:07:22,901 INFO L226 Difference]: Without dead ends: 41775 [2025-02-05 17:07:22,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:22,965 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4708 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:22,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12960 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2025-02-05 17:07:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 34465. [2025-02-05 17:07:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6426215223750544) internal successors, (52784), 32802 states have internal predecessors, (52784), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:07:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59426 transitions. [2025-02-05 17:07:25,010 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59426 transitions. Word has length 167 [2025-02-05 17:07:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:25,010 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59426 transitions. [2025-02-05 17:07:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59426 transitions. [2025-02-05 17:07:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:25,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:25,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:07:25,020 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1338871373, now seen corresponding path program 1 times [2025-02-05 17:07:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208292960] [2025-02-05 17:07:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:25,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:25,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:25,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:25,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208292960] [2025-02-05 17:07:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208292960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619290680] [2025-02-05 17:07:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:25,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:25,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:25,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:25,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:25,088 INFO L87 Difference]: Start difference. First operand 34465 states and 59426 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:26,781 INFO L93 Difference]: Finished difference Result 73369 states and 130054 transitions. [2025-02-05 17:07:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:26,910 INFO L225 Difference]: With dead ends: 73369 [2025-02-05 17:07:26,910 INFO L226 Difference]: Without dead ends: 41044 [2025-02-05 17:07:26,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:26,964 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4705 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12952 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:26,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12952 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41044 states. [2025-02-05 17:07:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41044 to 34465. [2025-02-05 17:07:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6405987427646729) internal successors, (52719), 32802 states have internal predecessors, (52719), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:07:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59361 transitions. [2025-02-05 17:07:29,562 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59361 transitions. Word has length 167 [2025-02-05 17:07:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:29,562 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59361 transitions. [2025-02-05 17:07:29,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59361 transitions. [2025-02-05 17:07:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:29,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:29,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:29,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:07:29,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1812897356, now seen corresponding path program 1 times [2025-02-05 17:07:29,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:29,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126121311] [2025-02-05 17:07:29,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:29,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:29,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:29,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:29,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126121311] [2025-02-05 17:07:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126121311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:29,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:29,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533507228] [2025-02-05 17:07:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:29,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:29,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:29,806 INFO L87 Difference]: Start difference. First operand 34465 states and 59361 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:33,384 INFO L93 Difference]: Finished difference Result 108112 states and 193016 transitions. [2025-02-05 17:07:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:33,800 INFO L225 Difference]: With dead ends: 108112 [2025-02-05 17:07:33,800 INFO L226 Difference]: Without dead ends: 75787 [2025-02-05 17:07:33,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:33,908 INFO L435 NwaCegarLoop]: 4661 mSDtfsCounter, 5150 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:33,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 18722 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:07:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2025-02-05 17:07:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 72024. [2025-02-05 17:07:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72024 states, 66731 states have (on average 1.6506721014221277) internal successors, (110151), 68793 states have internal predecessors, (110151), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-02-05 17:07:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72024 states to 72024 states and 131449 transitions. [2025-02-05 17:07:37,775 INFO L78 Accepts]: Start accepts. Automaton has 72024 states and 131449 transitions. Word has length 167 [2025-02-05 17:07:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:37,775 INFO L471 AbstractCegarLoop]: Abstraction has 72024 states and 131449 transitions. [2025-02-05 17:07:37,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72024 states and 131449 transitions. [2025-02-05 17:07:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:37,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:37,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:07:37,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2105283181, now seen corresponding path program 1 times [2025-02-05 17:07:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756486157] [2025-02-05 17:07:37,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:37,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:37,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:37,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:37,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756486157] [2025-02-05 17:07:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756486157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411260665] [2025-02-05 17:07:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:37,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:37,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:37,866 INFO L87 Difference]: Start difference. First operand 72024 states and 131449 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:42,731 INFO L93 Difference]: Finished difference Result 157231 states and 299630 transitions. [2025-02-05 17:07:42,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:42,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:07:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:43,186 INFO L225 Difference]: With dead ends: 157231 [2025-02-05 17:07:43,186 INFO L226 Difference]: Without dead ends: 87347 [2025-02-05 17:07:43,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:43,298 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4701 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 12938 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:43,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 12938 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:07:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87347 states. [2025-02-05 17:07:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87347 to 72024. [2025-02-05 17:07:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72024 states, 66731 states have (on average 1.6487389668969445) internal successors, (110022), 68793 states have internal predecessors, (110022), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-02-05 17:07:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72024 states to 72024 states and 131320 transitions. [2025-02-05 17:07:47,995 INFO L78 Accepts]: Start accepts. Automaton has 72024 states and 131320 transitions. Word has length 167 [2025-02-05 17:07:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 72024 states and 131320 transitions. [2025-02-05 17:07:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 72024 states and 131320 transitions. [2025-02-05 17:07:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:07:48,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:48,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:48,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:07:48,010 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:48,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash -175052332, now seen corresponding path program 1 times [2025-02-05 17:07:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250334825] [2025-02-05 17:07:48,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:48,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:07:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:07:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250334825] [2025-02-05 17:07:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250334825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789829015] [2025-02-05 17:07:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:48,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:48,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:48,089 INFO L87 Difference]: Start difference. First operand 72024 states and 131320 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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)