./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.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 656e7d531f093f57119c43761759c34009a10647aaa5132e17630f3bef948c7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:14:58,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:14:58,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:14:58,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:14:58,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:14:58,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:14:58,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:14:58,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:14:58,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:14:58,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:14:58,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:14:58,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:14:58,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:14:58,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:14:58,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:14:58,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:58,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:14:58,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:14:58,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:14:58,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:14:58,763 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 -> 656e7d531f093f57119c43761759c34009a10647aaa5132e17630f3bef948c7c [2025-01-09 05:14:59,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:14:59,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:14:59,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:14:59,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:14:59,012 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:14:59,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c [2025-01-09 05:15:00,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/febbed777/55c94eb4e6e74dfeb0686c73cf1e0999/FLAG21119a346 [2025-01-09 05:15:00,904 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:15:00,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c [2025-01-09 05:15:00,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/febbed777/55c94eb4e6e74dfeb0686c73cf1e0999/FLAG21119a346 [2025-01-09 05:15:01,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/febbed777/55c94eb4e6e74dfeb0686c73cf1e0999 [2025-01-09 05:15:01,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:15:01,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:15:01,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:01,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:15:01,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:15:01,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:01" (1/1) ... [2025-01-09 05:15:01,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6244536c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:01, skipping insertion in model container [2025-01-09 05:15:01,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:01" (1/1) ... [2025-01-09 05:15:01,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:15:02,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c[376251,376264] [2025-01-09 05:15:02,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:15:03,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:03,040 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:15:03,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c[376251,376264] [2025-01-09 05:15:03,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.05.cil-1.c[383339,383352] [2025-01-09 05:15:03,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:03,549 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:15:03,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03 WrapperNode [2025-01-09 05:15:03,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:03,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:03,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:15:03,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:15:03,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:03,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,048 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-01-09 05:15:04,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:04,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:15:04,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:15:04,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:15:04,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,258 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-01-09 05:15:04,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:15:04,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:15:04,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:15:04,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:15:04,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (1/1) ... [2025-01-09 05:15:04,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:04,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:15:04,658 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-01-09 05:15:04,663 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-01-09 05:15:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:15:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:15:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:15:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:15:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:15:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:15:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:15:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:15:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:15:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:15:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:15:04,787 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:15:04,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:15:11,827 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-01-09 05:15:11,828 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:15:11,864 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:15:11,865 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 05:15:11,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:15:11 BoogieIcfgContainer [2025-01-09 05:15:11,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:15:11,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:15:11,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:15:11,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:15:11,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:15:01" (1/3) ... [2025-01-09 05:15:11,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04b60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:15:11, skipping insertion in model container [2025-01-09 05:15:11,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:03" (2/3) ... [2025-01-09 05:15:11,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e04b60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:15:11, skipping insertion in model container [2025-01-09 05:15:11,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:15:11" (3/3) ... [2025-01-09 05:15:11,872 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.05.cil-1.c [2025-01-09 05:15:11,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:15:11,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.05.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 05:15:11,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:15:11,966 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;@6aa3da95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:15:11,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:15:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:15:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:11,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:11,983 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] [2025-01-09 05:15:11,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -148207991, now seen corresponding path program 1 times [2025-01-09 05:15:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122228273] [2025-01-09 05:15:11,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:12,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:12,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:12,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122228273] [2025-01-09 05:15:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122228273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:15:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611756963] [2025-01-09 05:15:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:12,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:15:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:12,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:15:12,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:15:12,210 INFO L87 Difference]: Start difference. First operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:15:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:12,372 INFO L93 Difference]: Finished difference Result 4767 states and 8789 transitions. [2025-01-09 05:15:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:15:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-01-09 05:15:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:12,390 INFO L225 Difference]: With dead ends: 4767 [2025-01-09 05:15:12,391 INFO L226 Difference]: Without dead ends: 2321 [2025-01-09 05:15:12,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:15:12,399 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 301 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 8353 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:12,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 8353 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:15:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-01-09 05:15:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-01-09 05:15:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2294 states have (on average 1.8417611159546643) internal successors, (4225), 2296 states have internal predecessors, (4225), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:15:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4263 transitions. [2025-01-09 05:15:12,494 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4263 transitions. Word has length 99 [2025-01-09 05:15:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:12,495 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4263 transitions. [2025-01-09 05:15:12,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:15:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4263 transitions. [2025-01-09 05:15:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:12,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:12,498 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] [2025-01-09 05:15:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:15:12,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:12,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 438068231, now seen corresponding path program 1 times [2025-01-09 05:15:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192658469] [2025-01-09 05:15:12,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:12,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:12,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192658469] [2025-01-09 05:15:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192658469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:12,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:12,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:15:12,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732601938] [2025-01-09 05:15:12,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:12,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:15:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:12,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:15:12,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:15:12,761 INFO L87 Difference]: Start difference. First operand 2321 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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-01-09 05:15:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:13,211 INFO L93 Difference]: Finished difference Result 2715 states and 4875 transitions. [2025-01-09 05:15:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:15:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:13,227 INFO L225 Difference]: With dead ends: 2715 [2025-01-09 05:15:13,227 INFO L226 Difference]: Without dead ends: 2528 [2025-01-09 05:15:13,230 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-01-09 05:15:13,230 INFO L435 NwaCegarLoop]: 4193 mSDtfsCounter, 4511 mSDsluCounter, 8500 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4524 SdHoareTripleChecker+Valid, 12693 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:13,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4524 Valid, 12693 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:15:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-01-09 05:15:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2513. [2025-01-09 05:15:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.822312373225152) internal successors, (4492), 2468 states have internal predecessors, (4492), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 05:15:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4559 transitions. [2025-01-09 05:15:13,310 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4559 transitions. Word has length 99 [2025-01-09 05:15:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4559 transitions. [2025-01-09 05:15:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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-01-09 05:15:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4559 transitions. [2025-01-09 05:15:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:13,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:13,312 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] [2025-01-09 05:15:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:15:13,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1145839477, now seen corresponding path program 1 times [2025-01-09 05:15:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295078006] [2025-01-09 05:15:13,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:13,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:13,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295078006] [2025-01-09 05:15:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295078006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659227745] [2025-01-09 05:15:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:13,557 INFO L87 Difference]: Start difference. First operand 2513 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:14,118 INFO L93 Difference]: Finished difference Result 3134 states and 5528 transitions. [2025-01-09 05:15:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:14,130 INFO L225 Difference]: With dead ends: 3134 [2025-01-09 05:15:14,130 INFO L226 Difference]: Without dead ends: 2755 [2025-01-09 05:15:14,133 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-01-09 05:15:14,135 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4507 mSDsluCounter, 13032 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 17379 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:14,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 17379 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-01-09 05:15:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2692. [2025-01-09 05:15:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2623 states have (on average 1.8044224170796797) internal successors, (4733), 2627 states have internal predecessors, (4733), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 05:15:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4831 transitions. [2025-01-09 05:15:14,209 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4831 transitions. Word has length 99 [2025-01-09 05:15:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:14,209 INFO L471 AbstractCegarLoop]: Abstraction has 2692 states and 4831 transitions. [2025-01-09 05:15:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4831 transitions. [2025-01-09 05:15:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:14,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:14,212 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] [2025-01-09 05:15:14,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:15:14,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:14,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash 420918473, now seen corresponding path program 1 times [2025-01-09 05:15:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:14,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205292074] [2025-01-09 05:15:14,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:14,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:14,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:14,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205292074] [2025-01-09 05:15:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205292074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772837031] [2025-01-09 05:15:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:14,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:14,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:14,353 INFO L87 Difference]: Start difference. First operand 2692 states and 4831 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:14,937 INFO L93 Difference]: Finished difference Result 3691 states and 6383 transitions. [2025-01-09 05:15:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:14,949 INFO L225 Difference]: With dead ends: 3691 [2025-01-09 05:15:14,950 INFO L226 Difference]: Without dead ends: 3133 [2025-01-09 05:15:14,952 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-01-09 05:15:14,953 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 4499 mSDsluCounter, 13010 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4512 SdHoareTripleChecker+Valid, 17349 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:14,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4512 Valid, 17349 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-01-09 05:15:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3068. [2025-01-09 05:15:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 2955 states have (on average 1.7746192893401016) internal successors, (5244), 2963 states have internal predecessors, (5244), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 05:15:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 5410 transitions. [2025-01-09 05:15:15,023 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 5410 transitions. Word has length 99 [2025-01-09 05:15:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 5410 transitions. [2025-01-09 05:15:15,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 5410 transitions. [2025-01-09 05:15:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:15,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:15,024 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] [2025-01-09 05:15:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:15:15,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -721583993, now seen corresponding path program 1 times [2025-01-09 05:15:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139239368] [2025-01-09 05:15:15,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:15,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:15,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:15,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:15,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139239368] [2025-01-09 05:15:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139239368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434959291] [2025-01-09 05:15:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:15,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:15,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:15,346 INFO L87 Difference]: Start difference. First operand 3068 states and 5410 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:16,197 INFO L93 Difference]: Finished difference Result 4883 states and 8252 transitions. [2025-01-09 05:15:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:16,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:16,217 INFO L225 Difference]: With dead ends: 4883 [2025-01-09 05:15:16,217 INFO L226 Difference]: Without dead ends: 3949 [2025-01-09 05:15:16,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:15:16,223 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4494 mSDsluCounter, 13001 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 17337 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:16,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 17337 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:15:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2025-01-09 05:15:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3871. [2025-01-09 05:15:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3664 states have (on average 1.732532751091703) internal successors, (6348), 3686 states have internal predecessors, (6348), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 05:15:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 6674 transitions. [2025-01-09 05:15:16,363 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 6674 transitions. Word has length 99 [2025-01-09 05:15:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 3871 states and 6674 transitions. [2025-01-09 05:15:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 6674 transitions. [2025-01-09 05:15:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:16,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:16,368 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] [2025-01-09 05:15:16,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:15:16,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -481344247, now seen corresponding path program 1 times [2025-01-09 05:15:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24945656] [2025-01-09 05:15:16,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:16,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:16,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:16,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:16,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:16,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:16,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24945656] [2025-01-09 05:15:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24945656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983453833] [2025-01-09 05:15:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:16,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:16,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:16,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:16,488 INFO L87 Difference]: Start difference. First operand 3871 states and 6674 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:17,034 INFO L93 Difference]: Finished difference Result 7452 states and 12402 transitions. [2025-01-09 05:15:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:17,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:17,058 INFO L225 Difference]: With dead ends: 7452 [2025-01-09 05:15:17,058 INFO L226 Difference]: Without dead ends: 5715 [2025-01-09 05:15:17,064 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-01-09 05:15:17,065 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4489 mSDsluCounter, 12992 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 17325 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:17,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 17325 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:15:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-01-09 05:15:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5612. [2025-01-09 05:15:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5199 states have (on average 1.6864781688786306) internal successors, (8768), 5267 states have internal predecessors, (8768), 243 states have call successors, (243), 102 states have call predecessors, (243), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 05:15:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 9510 transitions. [2025-01-09 05:15:17,259 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 9510 transitions. Word has length 99 [2025-01-09 05:15:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:17,259 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 9510 transitions. [2025-01-09 05:15:17,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 9510 transitions. [2025-01-09 05:15:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:17,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:17,267 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] [2025-01-09 05:15:17,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:15:17,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 357689415, now seen corresponding path program 1 times [2025-01-09 05:15:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650651086] [2025-01-09 05:15:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:17,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:17,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:17,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:17,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650651086] [2025-01-09 05:15:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650651086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094486326] [2025-01-09 05:15:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:17,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:17,426 INFO L87 Difference]: Start difference. First operand 5612 states and 9510 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:18,114 INFO L93 Difference]: Finished difference Result 13711 states and 22877 transitions. [2025-01-09 05:15:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:18,168 INFO L225 Difference]: With dead ends: 13711 [2025-01-09 05:15:18,168 INFO L226 Difference]: Without dead ends: 10233 [2025-01-09 05:15:18,190 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-01-09 05:15:18,193 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4673 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 16877 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:18,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 16877 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10233 states. [2025-01-09 05:15:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10233 to 9397. [2025-01-09 05:15:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9397 states, 8534 states have (on average 1.6531520974923835) internal successors, (14108), 8748 states have internal predecessors, (14108), 451 states have call successors, (451), 198 states have call predecessors, (451), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 05:15:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9397 states to 9397 states and 16034 transitions. [2025-01-09 05:15:18,567 INFO L78 Accepts]: Start accepts. Automaton has 9397 states and 16034 transitions. Word has length 99 [2025-01-09 05:15:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:18,568 INFO L471 AbstractCegarLoop]: Abstraction has 9397 states and 16034 transitions. [2025-01-09 05:15:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 9397 states and 16034 transitions. [2025-01-09 05:15:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:18,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:18,639 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] [2025-01-09 05:15:18,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:15:18,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 384755017, now seen corresponding path program 1 times [2025-01-09 05:15:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971214269] [2025-01-09 05:15:18,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:18,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:18,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:18,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971214269] [2025-01-09 05:15:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971214269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900261929] [2025-01-09 05:15:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:18,821 INFO L87 Difference]: Start difference. First operand 9397 states and 16034 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:19,748 INFO L93 Difference]: Finished difference Result 26418 states and 46011 transitions. [2025-01-09 05:15:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:19,822 INFO L225 Difference]: With dead ends: 26418 [2025-01-09 05:15:19,822 INFO L226 Difference]: Without dead ends: 19155 [2025-01-09 05:15:19,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:15:19,849 INFO L435 NwaCegarLoop]: 4324 mSDtfsCounter, 4521 mSDsluCounter, 12960 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 17284 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2025-01-09 05:15:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 17682. [2025-01-09 05:15:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17682 states, 15773 states have (on average 1.6364673809674761) internal successors, (25812), 16441 states have internal predecessors, (25812), 851 states have call successors, (851), 390 states have call predecessors, (851), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 05:15:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 31610 transitions. [2025-01-09 05:15:20,885 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 31610 transitions. Word has length 99 [2025-01-09 05:15:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 17682 states and 31610 transitions. [2025-01-09 05:15:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 31610 transitions. [2025-01-09 05:15:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:20,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:20,924 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] [2025-01-09 05:15:20,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:15:20,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1692581881, now seen corresponding path program 1 times [2025-01-09 05:15:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354761417] [2025-01-09 05:15:20,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:20,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:20,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:20,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354761417] [2025-01-09 05:15:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354761417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645420207] [2025-01-09 05:15:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:21,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:21,106 INFO L87 Difference]: Start difference. First operand 17682 states and 31610 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:22,679 INFO L93 Difference]: Finished difference Result 54225 states and 102961 transitions. [2025-01-09 05:15:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:22,981 INFO L225 Difference]: With dead ends: 54225 [2025-01-09 05:15:22,982 INFO L226 Difference]: Without dead ends: 38677 [2025-01-09 05:15:23,025 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-01-09 05:15:23,026 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4578 mSDsluCounter, 12954 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17276 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:23,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17276 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38677 states. [2025-01-09 05:15:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38677 to 36471. [2025-01-09 05:15:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36471 states, 32016 states have (on average 1.6324337831084457) internal successors, (52264), 34078 states have internal predecessors, (52264), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 05:15:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36471 states to 36471 states and 71886 transitions. [2025-01-09 05:15:25,362 INFO L78 Accepts]: Start accepts. Automaton has 36471 states and 71886 transitions. Word has length 99 [2025-01-09 05:15:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 36471 states and 71886 transitions. [2025-01-09 05:15:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 36471 states and 71886 transitions. [2025-01-09 05:15:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:25,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:25,378 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] [2025-01-09 05:15:25,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:15:25,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:25,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 41522569, now seen corresponding path program 1 times [2025-01-09 05:15:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315933554] [2025-01-09 05:15:25,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:25,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:25,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:25,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:25,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315933554] [2025-01-09 05:15:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315933554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:25,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:25,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472026201] [2025-01-09 05:15:25,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:25,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:25,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:25,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:25,463 INFO L87 Difference]: Start difference. First operand 36471 states and 71886 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:28,696 INFO L93 Difference]: Finished difference Result 116652 states and 255663 transitions. [2025-01-09 05:15:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:29,340 INFO L225 Difference]: With dead ends: 116652 [2025-01-09 05:15:29,341 INFO L226 Difference]: Without dead ends: 82315 [2025-01-09 05:15:29,494 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-01-09 05:15:29,495 INFO L435 NwaCegarLoop]: 4319 mSDtfsCounter, 4543 mSDsluCounter, 12945 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 17264 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:29,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 17264 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82315 states. [2025-01-09 05:15:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82315 to 78960. [2025-01-09 05:15:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78960 states, 68019 states have (on average 1.6290742292594715) internal successors, (110808), 74327 states have internal predecessors, (110808), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:15:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78960 states to 78960 states and 182526 transitions. [2025-01-09 05:15:35,320 INFO L78 Accepts]: Start accepts. Automaton has 78960 states and 182526 transitions. Word has length 99 [2025-01-09 05:15:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:35,320 INFO L471 AbstractCegarLoop]: Abstraction has 78960 states and 182526 transitions. [2025-01-09 05:15:35,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78960 states and 182526 transitions. [2025-01-09 05:15:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:35,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:35,350 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] [2025-01-09 05:15:35,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:15:35,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:35,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 928745415, now seen corresponding path program 1 times [2025-01-09 05:15:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:35,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456530598] [2025-01-09 05:15:35,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456530598] [2025-01-09 05:15:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456530598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:35,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:15:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344188414] [2025-01-09 05:15:35,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:35,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:15:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:35,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:15:35,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:15:35,448 INFO L87 Difference]: Start difference. First operand 78960 states and 182526 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:40,561 INFO L93 Difference]: Finished difference Result 168912 states and 433689 transitions. [2025-01-09 05:15:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:15:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 99 [2025-01-09 05:15:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:41,217 INFO L225 Difference]: With dead ends: 168912 [2025-01-09 05:15:41,217 INFO L226 Difference]: Without dead ends: 92086 [2025-01-09 05:15:41,634 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-01-09 05:15:41,634 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4343 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 12399 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:41,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 12399 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:15:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92086 states. [2025-01-09 05:15:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92086 to 78960. [2025-01-09 05:15:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78960 states, 68019 states have (on average 1.6252958732118967) internal successors, (110551), 74327 states have internal predecessors, (110551), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:15:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78960 states to 78960 states and 182269 transitions. [2025-01-09 05:15:49,838 INFO L78 Accepts]: Start accepts. Automaton has 78960 states and 182269 transitions. Word has length 99 [2025-01-09 05:15:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:49,838 INFO L471 AbstractCegarLoop]: Abstraction has 78960 states and 182269 transitions. [2025-01-09 05:15:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-01-09 05:15:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 78960 states and 182269 transitions. [2025-01-09 05:15:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:15:49,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:49,865 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] [2025-01-09 05:15:49,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:15:49,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:49,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1005646213, now seen corresponding path program 1 times [2025-01-09 05:15:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044052170] [2025-01-09 05:15:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:15:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:15:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:15:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044052170] [2025-01-09 05:15:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044052170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:15:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625982186] [2025-01-09 05:15:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:15:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:49,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:15:49,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:15:49,909 INFO L87 Difference]: Start difference. First operand 78960 states and 182269 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:15:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:55,186 INFO L93 Difference]: Finished difference Result 199693 states and 459630 transitions. [2025-01-09 05:15:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:15:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 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 99 [2025-01-09 05:15:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:55,855 INFO L225 Difference]: With dead ends: 199693 [2025-01-09 05:15:55,855 INFO L226 Difference]: Without dead ends: 122868 [2025-01-09 05:15:56,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:15:56,283 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 4477 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 8977 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:56,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 8977 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:15:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122868 states.