./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.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_label43+token_ring.06.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 d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:09:47,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:09:47,993 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:09:47,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:09:47,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:09:48,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:09:48,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:09:48,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:09:48,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:09:48,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:09:48,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:09:48,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:09:48,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:09:48,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:09:48,011 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:09:48,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:09:48,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:09:48,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:48,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:09:48,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:09:48,013 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 -> d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 [2025-02-05 17:09:48,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:09:48,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:09:48,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:09:48,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:09:48,207 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:09:48,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2025-02-05 17:09:49,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16405f9/5cd8e5344b97462ca3bcc095648d4011/FLAGa3c1273b7 [2025-02-05 17:09:49,958 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:09:49,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2025-02-05 17:09:50,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16405f9/5cd8e5344b97462ca3bcc095648d4011/FLAGa3c1273b7 [2025-02-05 17:09:50,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a16405f9/5cd8e5344b97462ca3bcc095648d4011 [2025-02-05 17:09:50,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:09:50,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:09:50,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:50,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:09:50,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:09:50,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:50" (1/1) ... [2025-02-05 17:09:50,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:50, skipping insertion in model container [2025-02-05 17:09:50,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:50" (1/1) ... [2025-02-05 17:09:50,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:09:51,844 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_label43+token_ring.06.cil-2.c[381679,381692] [2025-02-05 17:09:51,872 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_label43+token_ring.06.cil-2.c[383339,383352] [2025-02-05 17:09:52,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:52,011 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:09:52,500 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_label43+token_ring.06.cil-2.c[381679,381692] [2025-02-05 17:09:52,509 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_label43+token_ring.06.cil-2.c[383339,383352] [2025-02-05 17:09:52,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:52,575 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:09:52,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52 WrapperNode [2025-02-05 17:09:52,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:52,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:52,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:09:52,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:09:52,581 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:09:52" (1/1) ... [2025-02-05 17:09:52,678 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:09:52" (1/1) ... [2025-02-05 17:09:53,007 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-02-05 17:09:53,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:53,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:09:53,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:09:53,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:09:53,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,150 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:09:53,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:09:53,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:09:53,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:09:53,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:09:53,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (1/1) ... [2025-02-05 17:09:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:53,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:53,508 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:09:53,512 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:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:09:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:09:53,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:09:53,620 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:09:53,626 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:09:59,664 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:09:59,664 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:09:59,665 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:09:59,665 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:09:59,666 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:09:59,666 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:09:59,666 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:09:59,926 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-02-05 17:09:59,927 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:09:59,983 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:09:59,986 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:09:59,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:59 BoogieIcfgContainer [2025-02-05 17:09:59,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:09:59,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:09:59,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:09:59,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:09:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:09:50" (1/3) ... [2025-02-05 17:09:59,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c0495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:59, skipping insertion in model container [2025-02-05 17:09:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:52" (2/3) ... [2025-02-05 17:09:59,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c0495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:59, skipping insertion in model container [2025-02-05 17:09:59,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:59" (3/3) ... [2025-02-05 17:09:59,995 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.06.cil-2.c [2025-02-05 17:10:00,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:10:00,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.06.cil-2.c that has 7 procedures, 2429 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-02-05 17:10:00,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:10:00,123 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;@66a9cbda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:10:00,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:10:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 2429 states, 2400 states have (on average 1.8420833333333333) internal successors, (4421), 2403 states have internal predecessors, (4421), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:10:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:00,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:00,145 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] [2025-02-05 17:10:00,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1873398505, now seen corresponding path program 1 times [2025-02-05 17:10:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:00,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313943472] [2025-02-05 17:10:00,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:00,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:00,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:00,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:00,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:00,539 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:10:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313943472] [2025-02-05 17:10:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313943472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769194847] [2025-02-05 17:10:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:00,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:00,570 INFO L87 Difference]: Start difference. First operand has 2429 states, 2400 states have (on average 1.8420833333333333) internal successors, (4421), 2403 states have internal predecessors, (4421), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:10:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:01,076 INFO L93 Difference]: Finished difference Result 5098 states and 9301 transitions. [2025-02-05 17:10:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:10:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:01,095 INFO L225 Difference]: With dead ends: 5098 [2025-02-05 17:10:01,096 INFO L226 Difference]: Without dead ends: 2613 [2025-02-05 17:10:01,109 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:10:01,111 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4680 mSDsluCounter, 8779 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 13091 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:01,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 13091 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2025-02-05 17:10:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2596. [2025-02-05 17:10:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2546 states have (on average 1.8087195600942656) internal successors, (4605), 2549 states have internal predecessors, (4605), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-05 17:10:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 4676 transitions. [2025-02-05 17:10:01,232 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 4676 transitions. Word has length 112 [2025-02-05 17:10:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:01,233 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 4676 transitions. [2025-02-05 17:10:01,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:10:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 4676 transitions. [2025-02-05 17:10:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:01,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:01,236 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] [2025-02-05 17:10:01,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:01,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 365414187, now seen corresponding path program 1 times [2025-02-05 17:10:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736812596] [2025-02-05 17:10:01,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:01,459 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:10:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736812596] [2025-02-05 17:10:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736812596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80885370] [2025-02-05 17:10:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:01,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:01,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:01,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:01,461 INFO L87 Difference]: Start difference. First operand 2596 states and 4676 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:01,843 INFO L93 Difference]: Finished difference Result 3099 states and 5453 transitions. [2025-02-05 17:10:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:01,855 INFO L225 Difference]: With dead ends: 3099 [2025-02-05 17:10:01,857 INFO L226 Difference]: Without dead ends: 2638 [2025-02-05 17:10:01,860 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:10:01,861 INFO L435 NwaCegarLoop]: 4231 mSDtfsCounter, 4431 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:01,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 12598 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-02-05 17:10:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2596. [2025-02-05 17:10:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2546 states have (on average 1.8079340141398272) internal successors, (4603), 2549 states have internal predecessors, (4603), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-05 17:10:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 4674 transitions. [2025-02-05 17:10:01,939 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 4674 transitions. Word has length 112 [2025-02-05 17:10:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:01,940 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 4674 transitions. [2025-02-05 17:10:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 4674 transitions. [2025-02-05 17:10:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:01,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:01,944 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] [2025-02-05 17:10:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:01,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:01,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -444073270, now seen corresponding path program 1 times [2025-02-05 17:10:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291509985] [2025-02-05 17:10:01,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:01,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:01,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:01,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:02,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:10:02,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291509985] [2025-02-05 17:10:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291509985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128620782] [2025-02-05 17:10:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:02,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:02,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:02,125 INFO L87 Difference]: Start difference. First operand 2596 states and 4674 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:02,624 INFO L93 Difference]: Finished difference Result 3344 states and 5818 transitions. [2025-02-05 17:10:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:02,637 INFO L225 Difference]: With dead ends: 3344 [2025-02-05 17:10:02,638 INFO L226 Difference]: Without dead ends: 2883 [2025-02-05 17:10:02,640 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:10:02,641 INFO L435 NwaCegarLoop]: 4430 mSDtfsCounter, 4603 mSDsluCounter, 13307 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 17737 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:02,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4617 Valid, 17737 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2025-02-05 17:10:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2814. [2025-02-05 17:10:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2742 states have (on average 1.7848285922684173) internal successors, (4894), 2746 states have internal predecessors, (4894), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-02-05 17:10:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 4998 transitions. [2025-02-05 17:10:02,716 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 4998 transitions. Word has length 112 [2025-02-05 17:10:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:02,717 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 4998 transitions. [2025-02-05 17:10:02,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4998 transitions. [2025-02-05 17:10:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:02,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:02,719 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] [2025-02-05 17:10:02,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:02,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -885827765, now seen corresponding path program 1 times [2025-02-05 17:10:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:02,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123725366] [2025-02-05 17:10:02,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:02,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:02,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:02,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:02,922 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:10:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123725366] [2025-02-05 17:10:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123725366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979644714] [2025-02-05 17:10:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:02,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:02,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:02,926 INFO L87 Difference]: Start difference. First operand 2814 states and 4998 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:03,412 INFO L93 Difference]: Finished difference Result 4029 states and 6851 transitions. [2025-02-05 17:10:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:03,425 INFO L225 Difference]: With dead ends: 4029 [2025-02-05 17:10:03,426 INFO L226 Difference]: Without dead ends: 3350 [2025-02-05 17:10:03,429 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:10:03,429 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4598 mSDsluCounter, 13295 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4612 SdHoareTripleChecker+Valid, 17721 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:03,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4612 Valid, 17721 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2025-02-05 17:10:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3273. [2025-02-05 17:10:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3155 states have (on average 1.7480190174326466) internal successors, (5515), 3163 states have internal predecessors, (5515), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-02-05 17:10:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 5691 transitions. [2025-02-05 17:10:03,510 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 5691 transitions. Word has length 112 [2025-02-05 17:10:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 5691 transitions. [2025-02-05 17:10:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 5691 transitions. [2025-02-05 17:10:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:03,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:03,512 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] [2025-02-05 17:10:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:03,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -900077910, now seen corresponding path program 1 times [2025-02-05 17:10:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202564313] [2025-02-05 17:10:03,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:03,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:03,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:03,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:03,612 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:10:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202564313] [2025-02-05 17:10:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202564313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:03,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790392223] [2025-02-05 17:10:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:03,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:03,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:03,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:03,613 INFO L87 Difference]: Start difference. First operand 3273 states and 5691 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:04,094 INFO L93 Difference]: Finished difference Result 5486 states and 9094 transitions. [2025-02-05 17:10:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:04,113 INFO L225 Difference]: With dead ends: 5486 [2025-02-05 17:10:04,114 INFO L226 Difference]: Without dead ends: 4348 [2025-02-05 17:10:04,119 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:10:04,120 INFO L435 NwaCegarLoop]: 4423 mSDtfsCounter, 4593 mSDsluCounter, 13286 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4607 SdHoareTripleChecker+Valid, 17709 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:04,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4607 Valid, 17709 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2025-02-05 17:10:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4254. [2025-02-05 17:10:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4038 states have (on average 1.6996037642397226) internal successors, (6863), 4060 states have internal predecessors, (6863), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-02-05 17:10:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 7207 transitions. [2025-02-05 17:10:04,241 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 7207 transitions. Word has length 112 [2025-02-05 17:10:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:04,241 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 7207 transitions. [2025-02-05 17:10:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 7207 transitions. [2025-02-05 17:10:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:04,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:04,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:04,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:04,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1870368917, now seen corresponding path program 1 times [2025-02-05 17:10:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833674296] [2025-02-05 17:10:04,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:04,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:04,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:04,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:04,347 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:10:04,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:04,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833674296] [2025-02-05 17:10:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833674296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034603326] [2025-02-05 17:10:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:04,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:04,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:04,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:04,349 INFO L87 Difference]: Start difference. First operand 4254 states and 7207 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:04,924 INFO L93 Difference]: Finished difference Result 8633 states and 14088 transitions. [2025-02-05 17:10:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:04,958 INFO L225 Difference]: With dead ends: 8633 [2025-02-05 17:10:04,959 INFO L226 Difference]: Without dead ends: 6514 [2025-02-05 17:10:04,968 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:10:04,969 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4612 mSDsluCounter, 12879 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4626 SdHoareTripleChecker+Valid, 17132 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:04,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4626 Valid, 17132 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2025-02-05 17:10:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6387. [2025-02-05 17:10:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 5957 states have (on average 1.6523417827765654) internal successors, (9843), 6025 states have internal predecessors, (9843), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-02-05 17:10:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 10619 transitions. [2025-02-05 17:10:05,224 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 10619 transitions. Word has length 112 [2025-02-05 17:10:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 6387 states and 10619 transitions. [2025-02-05 17:10:05,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 10619 transitions. [2025-02-05 17:10:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:05,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:05,228 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] [2025-02-05 17:10:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:05,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -931837302, now seen corresponding path program 1 times [2025-02-05 17:10:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002499415] [2025-02-05 17:10:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:05,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:05,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:05,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:05,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:05,339 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:10:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002499415] [2025-02-05 17:10:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002499415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230496665] [2025-02-05 17:10:05,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:05,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:05,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:05,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:05,342 INFO L87 Difference]: Start difference. First operand 6387 states and 10619 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:05,950 INFO L93 Difference]: Finished difference Result 15552 states and 25578 transitions. [2025-02-05 17:10:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:06,013 INFO L225 Difference]: With dead ends: 15552 [2025-02-05 17:10:06,013 INFO L226 Difference]: Without dead ends: 11300 [2025-02-05 17:10:06,029 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:10:06,030 INFO L435 NwaCegarLoop]: 4417 mSDtfsCounter, 4583 mSDsluCounter, 13268 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17685 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:06,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17685 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2025-02-05 17:10:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 11112. [2025-02-05 17:10:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11112 states, 10200 states have (on average 1.6226470588235293) internal successors, (16551), 10414 states have internal predecessors, (16551), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-02-05 17:10:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 18575 transitions. [2025-02-05 17:10:06,482 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 18575 transitions. Word has length 112 [2025-02-05 17:10:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 11112 states and 18575 transitions. [2025-02-05 17:10:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 18575 transitions. [2025-02-05 17:10:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:06,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:06,490 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] [2025-02-05 17:10:06,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:06,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1317204085, now seen corresponding path program 1 times [2025-02-05 17:10:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344018143] [2025-02-05 17:10:06,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:06,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:06,584 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:10:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344018143] [2025-02-05 17:10:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344018143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788639958] [2025-02-05 17:10:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:06,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:06,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:06,586 INFO L87 Difference]: Start difference. First operand 11112 states and 18575 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:07,489 INFO L93 Difference]: Finished difference Result 32555 states and 55401 transitions. [2025-02-05 17:10:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:07,585 INFO L225 Difference]: With dead ends: 32555 [2025-02-05 17:10:07,585 INFO L226 Difference]: Without dead ends: 23578 [2025-02-05 17:10:07,623 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:10:07,623 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4772 mSDsluCounter, 13248 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 17660 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:07,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 17660 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2025-02-05 17:10:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 21681. [2025-02-05 17:10:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21681 states, 19675 states have (on average 1.6178398983481577) internal successors, (31831), 20343 states have internal predecessors, (31831), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-02-05 17:10:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21681 states to 21681 states and 37823 transitions. [2025-02-05 17:10:08,464 INFO L78 Accepts]: Start accepts. Automaton has 21681 states and 37823 transitions. Word has length 112 [2025-02-05 17:10:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 21681 states and 37823 transitions. [2025-02-05 17:10:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 21681 states and 37823 transitions. [2025-02-05 17:10:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:08,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:08,476 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] [2025-02-05 17:10:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:10:08,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 332932714, now seen corresponding path program 1 times [2025-02-05 17:10:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313999404] [2025-02-05 17:10:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:08,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:08,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:08,549 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:10:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313999404] [2025-02-05 17:10:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313999404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:08,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:08,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900552191] [2025-02-05 17:10:08,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:08,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:08,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:08,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:08,551 INFO L87 Difference]: Start difference. First operand 21681 states and 37823 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:09,579 INFO L93 Difference]: Finished difference Result 46344 states and 83934 transitions. [2025-02-05 17:10:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:09,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:09,696 INFO L225 Difference]: With dead ends: 46344 [2025-02-05 17:10:09,696 INFO L226 Difference]: Without dead ends: 26798 [2025-02-05 17:10:09,759 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:10:09,760 INFO L435 NwaCegarLoop]: 4216 mSDtfsCounter, 4420 mSDsluCounter, 8336 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 12552 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:09,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 12552 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26798 states. [2025-02-05 17:10:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26798 to 21681. [2025-02-05 17:10:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21681 states, 19675 states have (on average 1.6145362134688692) internal successors, (31766), 20343 states have internal predecessors, (31766), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-02-05 17:10:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21681 states to 21681 states and 37758 transitions. [2025-02-05 17:10:10,753 INFO L78 Accepts]: Start accepts. Automaton has 21681 states and 37758 transitions. Word has length 112 [2025-02-05 17:10:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:10,755 INFO L471 AbstractCegarLoop]: Abstraction has 21681 states and 37758 transitions. [2025-02-05 17:10:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21681 states and 37758 transitions. [2025-02-05 17:10:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:10,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:10,763 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] [2025-02-05 17:10:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:10:10,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:10,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2107689045, now seen corresponding path program 1 times [2025-02-05 17:10:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502713779] [2025-02-05 17:10:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:10,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:10,847 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:10:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502713779] [2025-02-05 17:10:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502713779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500623455] [2025-02-05 17:10:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:10,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:10,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:10,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:10,850 INFO L87 Difference]: Start difference. First operand 21681 states and 37758 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:12,300 INFO L93 Difference]: Finished difference Result 67422 states and 123668 transitions. [2025-02-05 17:10:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:12,506 INFO L225 Difference]: With dead ends: 67422 [2025-02-05 17:10:12,507 INFO L226 Difference]: Without dead ends: 47876 [2025-02-05 17:10:12,710 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:10:12,710 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4699 mSDsluCounter, 13225 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 17629 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:12,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 17629 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47876 states. [2025-02-05 17:10:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47876 to 45153. [2025-02-05 17:10:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6187631156647329) internal successors, (65568), 42567 states have internal predecessors, (65568), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85576 transitions. [2025-02-05 17:10:15,340 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85576 transitions. Word has length 112 [2025-02-05 17:10:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85576 transitions. [2025-02-05 17:10:15,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:10:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85576 transitions. [2025-02-05 17:10:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:15,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:15,361 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] [2025-02-05 17:10:15,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:10:15,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:15,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash -939492790, now seen corresponding path program 1 times [2025-02-05 17:10:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:15,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332287148] [2025-02-05 17:10:15,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:15,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:15,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:15,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:15,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:15,458 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:10:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332287148] [2025-02-05 17:10:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332287148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415152617] [2025-02-05 17:10:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:15,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:15,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:15,460 INFO L87 Difference]: Start difference. First operand 45153 states and 85576 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:17,738 INFO L93 Difference]: Finished difference Result 99116 states and 199138 transitions. [2025-02-05 17:10:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:17,989 INFO L225 Difference]: With dead ends: 99116 [2025-02-05 17:10:17,989 INFO L226 Difference]: Without dead ends: 56098 [2025-02-05 17:10:18,094 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:10:18,096 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4416 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12538 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:18,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12538 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56098 states. [2025-02-05 17:10:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56098 to 45153. [2025-02-05 17:10:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6155783236637453) internal successors, (65439), 42567 states have internal predecessors, (65439), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85447 transitions. [2025-02-05 17:10:21,235 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85447 transitions. Word has length 112 [2025-02-05 17:10:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:21,236 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85447 transitions. [2025-02-05 17:10:21,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85447 transitions. [2025-02-05 17:10:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:21,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:21,252 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] [2025-02-05 17:10:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:10:21,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:21,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2146232267, now seen corresponding path program 1 times [2025-02-05 17:10:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847497537] [2025-02-05 17:10:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:21,335 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:10:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847497537] [2025-02-05 17:10:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847497537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520719849] [2025-02-05 17:10:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:21,336 INFO L87 Difference]: Start difference. First operand 45153 states and 85447 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:24,037 INFO L93 Difference]: Finished difference Result 96927 states and 194502 transitions. [2025-02-05 17:10:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:10:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:24,281 INFO L225 Difference]: With dead ends: 96927 [2025-02-05 17:10:24,281 INFO L226 Difference]: Without dead ends: 53909 [2025-02-05 17:10:24,362 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:10:24,362 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 4413 mSDsluCounter, 8322 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 12530 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:24,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 12530 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:10:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53909 states. [2025-02-05 17:10:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53909 to 45153. [2025-02-05 17:10:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6123935316627578) internal successors, (65310), 42567 states have internal predecessors, (65310), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:10:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85318 transitions. [2025-02-05 17:10:27,154 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85318 transitions. Word has length 112 [2025-02-05 17:10:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85318 transitions. [2025-02-05 17:10:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:10:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85318 transitions. [2025-02-05 17:10:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:10:27,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:27,170 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] [2025-02-05 17:10:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:10:27,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:27,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash -940816854, now seen corresponding path program 1 times [2025-02-05 17:10:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538188193] [2025-02-05 17:10:27,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:27,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:10:27,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:10:27,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:27,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:27,250 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:10:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538188193] [2025-02-05 17:10:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538188193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557826799] [2025-02-05 17:10:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:27,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:27,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:27,252 INFO L87 Difference]: Start difference. First operand 45153 states and 85318 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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)