./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.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_label42+token_ring.07.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 e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:16:33,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:16:33,741 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:16:33,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:16:33,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:16:33,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:16:33,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:16:33,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:16:33,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:16:33,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:16:33,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:16:33,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:16:33,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:16:33,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:33,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:33,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:16:33,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:16:33,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:16:33,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:16:33,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:16:33,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:16:33,781 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 -> e70b00a4f3ead30bf9fe88f8130a3c8de29ffa3a9165185f8db2f923a85de85c [2025-01-09 05:16:34,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:16:34,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:16:34,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:16:34,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:16:34,023 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:16:34,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2025-01-09 05:16:35,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219a4d99b/5f67c02303b041c9b09d5ed4350d81cb/FLAG662493a23 [2025-01-09 05:16:35,833 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:16:35,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-1.c [2025-01-09 05:16:35,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219a4d99b/5f67c02303b041c9b09d5ed4350d81cb/FLAG662493a23 [2025-01-09 05:16:36,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219a4d99b/5f67c02303b041c9b09d5ed4350d81cb [2025-01-09 05:16:36,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:16:36,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:16:36,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:16:36,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:16:36,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:16:36,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:36" (1/1) ... [2025-01-09 05:16:36,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cef2caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:36, skipping insertion in model container [2025-01-09 05:16:36,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:36" (1/1) ... [2025-01-09 05:16:36,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:16:37,667 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_label42+token_ring.07.cil-1.c[378560,378573] [2025-01-09 05:16:37,695 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_label42+token_ring.07.cil-1.c[383339,383352] [2025-01-09 05:16:37,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:16:37,892 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:16:38,469 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_label42+token_ring.07.cil-1.c[378560,378573] [2025-01-09 05:16:38,476 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_label42+token_ring.07.cil-1.c[383339,383352] [2025-01-09 05:16:38,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:16:38,541 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:16:38,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38 WrapperNode [2025-01-09 05:16:38,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:16:38,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:16:38,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:16:38,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:16:38,550 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:16:38" (1/1) ... [2025-01-09 05:16:38,612 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:16:38" (1/1) ... [2025-01-09 05:16:38,943 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-01-09 05:16:38,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:16:38,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:16:38,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:16:38,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:16:38,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:38,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:38,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,042 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:16:39,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:16:39,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:16:39,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:16:39,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:16:39,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (1/1) ... [2025-01-09 05:16:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:39,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:16:39,567 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:16:39,572 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:16:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:16:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:16:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:16:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:16:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:16:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:16:39,594 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:16:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:16:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:16:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:16:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:16:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:16:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:16:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:16:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:16:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:16:39,690 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:16:39,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:16:45,819 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-01-09 05:16:45,820 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:16:45,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:16:45,876 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 05:16:45,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:45 BoogieIcfgContainer [2025-01-09 05:16:45,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:16:45,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:16:45,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:16:45,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:16:45,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:16:36" (1/3) ... [2025-01-09 05:16:45,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e589e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:45, skipping insertion in model container [2025-01-09 05:16:45,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:38" (2/3) ... [2025-01-09 05:16:45,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e589e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:16:45, skipping insertion in model container [2025-01-09 05:16:45,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:16:45" (3/3) ... [2025-01-09 05:16:45,889 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.07.cil-1.c [2025-01-09 05:16:45,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:16:45,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.07.cil-1.c that has 7 procedures, 2438 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-01-09 05:16:45,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:16:46,059 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;@75d30744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:16:46,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:16:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:16:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:46,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:46,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:46,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1615448220, now seen corresponding path program 1 times [2025-01-09 05:16:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:46,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684514715] [2025-01-09 05:16:46,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:46,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:46,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:46,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:46,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:46,352 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:16:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684514715] [2025-01-09 05:16:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684514715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:16:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293601100] [2025-01-09 05:16:46,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:46,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:16:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:46,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:16:46,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:16:46,379 INFO L87 Difference]: Start difference. First operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:16:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:46,545 INFO L93 Difference]: Finished difference Result 4871 states and 8965 transitions. [2025-01-09 05:16:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:16:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:46,567 INFO L225 Difference]: With dead ends: 4871 [2025-01-09 05:16:46,567 INFO L226 Difference]: Without dead ends: 2371 [2025-01-09 05:16:46,576 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:16:46,578 INFO L435 NwaCegarLoop]: 4413 mSDtfsCounter, 387 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 8435 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:16:46,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 8435 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:16:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2025-01-09 05:16:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2025-01-09 05:16:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2342 states have (on average 1.8373185311699403) internal successors, (4303), 2344 states have internal predecessors, (4303), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:16:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4345 transitions. [2025-01-09 05:16:46,698 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4345 transitions. Word has length 121 [2025-01-09 05:16:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:46,699 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4345 transitions. [2025-01-09 05:16:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:16:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4345 transitions. [2025-01-09 05:16:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:46,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:46,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:46,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:16:46,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash -111696742, now seen corresponding path program 1 times [2025-01-09 05:16:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099906023] [2025-01-09 05:16:46,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:46,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:46,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:46,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:46,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:46,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:46,957 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:16:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099906023] [2025-01-09 05:16:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099906023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:46,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:16:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83897537] [2025-01-09 05:16:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:46,961 INFO L87 Difference]: Start difference. First operand 2371 states and 4345 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:16:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:47,422 INFO L93 Difference]: Finished difference Result 2869 states and 5129 transitions. [2025-01-09 05:16:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:16:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:47,436 INFO L225 Difference]: With dead ends: 2869 [2025-01-09 05:16:47,436 INFO L226 Difference]: Without dead ends: 2634 [2025-01-09 05:16:47,438 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:16:47,439 INFO L435 NwaCegarLoop]: 4257 mSDtfsCounter, 4681 mSDsluCounter, 8668 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4696 SdHoareTripleChecker+Valid, 12925 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:47,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4696 Valid, 12925 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-01-09 05:16:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2615. [2025-01-09 05:16:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2563 states have (on average 1.815060476004682) internal successors, (4652), 2566 states have internal predecessors, (4652), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-01-09 05:16:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4727 transitions. [2025-01-09 05:16:47,524 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4727 transitions. Word has length 121 [2025-01-09 05:16:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:47,525 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 4727 transitions. [2025-01-09 05:16:47,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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:16:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4727 transitions. [2025-01-09 05:16:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:47,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:47,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:47,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:16:47,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:47,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2077489950, now seen corresponding path program 1 times [2025-01-09 05:16:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:47,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830036757] [2025-01-09 05:16:47,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:47,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:47,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:47,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:47,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:47,715 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:16:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:47,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830036757] [2025-01-09 05:16:47,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830036757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:47,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:47,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:47,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355105896] [2025-01-09 05:16:47,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:47,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:47,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:47,718 INFO L87 Difference]: Start difference. First operand 2615 states and 4727 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:48,283 INFO L93 Difference]: Finished difference Result 3404 states and 5978 transitions. [2025-01-09 05:16:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:48,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:48,296 INFO L225 Difference]: With dead ends: 3404 [2025-01-09 05:16:48,297 INFO L226 Difference]: Without dead ends: 2925 [2025-01-09 05:16:48,300 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:16:48,303 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 4681 mSDsluCounter, 13380 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4696 SdHoareTripleChecker+Valid, 17837 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:48,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4696 Valid, 17837 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2025-01-09 05:16:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2842. [2025-01-09 05:16:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2767 states have (on average 1.795084929526563) internal successors, (4967), 2771 states have internal predecessors, (4967), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-01-09 05:16:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 5077 transitions. [2025-01-09 05:16:48,438 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 5077 transitions. Word has length 121 [2025-01-09 05:16:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 2842 states and 5077 transitions. [2025-01-09 05:16:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 5077 transitions. [2025-01-09 05:16:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:48,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:48,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:48,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:16:48,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 210781276, now seen corresponding path program 1 times [2025-01-09 05:16:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845890104] [2025-01-09 05:16:48,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:48,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:48,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:48,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:48,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:48,618 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:16:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:48,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845890104] [2025-01-09 05:16:48,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845890104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:48,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:48,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083590365] [2025-01-09 05:16:48,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:48,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:48,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:48,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:48,622 INFO L87 Difference]: Start difference. First operand 2842 states and 5077 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:49,212 INFO L93 Difference]: Finished difference Result 4125 states and 7107 transitions. [2025-01-09 05:16:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:49,228 INFO L225 Difference]: With dead ends: 4125 [2025-01-09 05:16:49,229 INFO L226 Difference]: Without dead ends: 3419 [2025-01-09 05:16:49,232 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:16:49,235 INFO L435 NwaCegarLoop]: 4453 mSDtfsCounter, 4676 mSDsluCounter, 13368 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 17821 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:49,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 17821 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2025-01-09 05:16:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3325. [2025-01-09 05:16:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3202 states have (on average 1.7638975640224859) internal successors, (5648), 3210 states have internal predecessors, (5648), 85 states have call successors, (85), 30 states have call predecessors, (85), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-01-09 05:16:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 5834 transitions. [2025-01-09 05:16:49,351 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 5834 transitions. Word has length 121 [2025-01-09 05:16:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:49,351 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 5834 transitions. [2025-01-09 05:16:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 5834 transitions. [2025-01-09 05:16:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:49,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:49,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:49,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:16:49,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:49,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1096361122, now seen corresponding path program 1 times [2025-01-09 05:16:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:49,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117078456] [2025-01-09 05:16:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:49,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:49,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:49,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:49,474 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:16:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117078456] [2025-01-09 05:16:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117078456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:49,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874365972] [2025-01-09 05:16:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:49,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:49,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:49,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:49,476 INFO L87 Difference]: Start difference. First operand 3325 states and 5834 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:50,061 INFO L93 Difference]: Finished difference Result 5678 states and 9590 transitions. [2025-01-09 05:16:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:50,079 INFO L225 Difference]: With dead ends: 5678 [2025-01-09 05:16:50,079 INFO L226 Difference]: Without dead ends: 4489 [2025-01-09 05:16:50,084 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:16:50,084 INFO L435 NwaCegarLoop]: 4450 mSDtfsCounter, 4671 mSDsluCounter, 13359 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4686 SdHoareTripleChecker+Valid, 17809 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:50,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4686 Valid, 17809 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2025-01-09 05:16:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4372. [2025-01-09 05:16:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 4147 states have (on average 1.7246202073788282) internal successors, (7152), 4169 states have internal predecessors, (7152), 149 states have call successors, (149), 54 states have call predecessors, (149), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-01-09 05:16:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 7514 transitions. [2025-01-09 05:16:50,193 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 7514 transitions. Word has length 121 [2025-01-09 05:16:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:50,194 INFO L471 AbstractCegarLoop]: Abstraction has 4372 states and 7514 transitions. [2025-01-09 05:16:50,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 7514 transitions. [2025-01-09 05:16:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:50,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:50,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:50,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:16:50,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 801135644, now seen corresponding path program 1 times [2025-01-09 05:16:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812498836] [2025-01-09 05:16:50,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:50,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:50,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:50,303 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:16:50,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:50,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812498836] [2025-01-09 05:16:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812498836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465149526] [2025-01-09 05:16:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:50,305 INFO L87 Difference]: Start difference. First operand 4372 states and 7514 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:50,947 INFO L93 Difference]: Finished difference Result 9089 states and 15208 transitions. [2025-01-09 05:16:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:50,974 INFO L225 Difference]: With dead ends: 9089 [2025-01-09 05:16:50,974 INFO L226 Difference]: Without dead ends: 6853 [2025-01-09 05:16:50,982 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:16:50,983 INFO L435 NwaCegarLoop]: 4447 mSDtfsCounter, 4666 mSDsluCounter, 13350 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 17797 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:50,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 17797 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:16:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6853 states. [2025-01-09 05:16:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6853 to 6691. [2025-01-09 05:16:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6691 states, 6244 states have (on average 1.6899423446508648) internal successors, (10552), 6312 states have internal predecessors, (10552), 277 states have call successors, (277), 102 states have call predecessors, (277), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-01-09 05:16:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 11362 transitions. [2025-01-09 05:16:51,157 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 11362 transitions. Word has length 121 [2025-01-09 05:16:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:51,157 INFO L471 AbstractCegarLoop]: Abstraction has 6691 states and 11362 transitions. [2025-01-09 05:16:51,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 11362 transitions. [2025-01-09 05:16:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:51,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:51,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:51,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:16:51,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1832176542, now seen corresponding path program 1 times [2025-01-09 05:16:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:51,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397356130] [2025-01-09 05:16:51,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:51,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:51,264 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:16:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:51,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397356130] [2025-01-09 05:16:51,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397356130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401323724] [2025-01-09 05:16:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:51,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:51,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:51,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:51,265 INFO L87 Difference]: Start difference. First operand 6691 states and 11362 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:51,971 INFO L93 Difference]: Finished difference Result 16752 states and 28378 transitions. [2025-01-09 05:16:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:52,025 INFO L225 Difference]: With dead ends: 16752 [2025-01-09 05:16:52,025 INFO L226 Difference]: Without dead ends: 12197 [2025-01-09 05:16:52,040 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:16:52,040 INFO L435 NwaCegarLoop]: 4444 mSDtfsCounter, 4661 mSDsluCounter, 13341 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4676 SdHoareTripleChecker+Valid, 17785 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:52,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4676 Valid, 17785 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:16:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12197 states. [2025-01-09 05:16:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12197 to 11950. [2025-01-09 05:16:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11950 states, 11005 states have (on average 1.674148114493412) internal successors, (18424), 11219 states have internal predecessors, (18424), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:16:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11950 states to 11950 states and 20514 transitions. [2025-01-09 05:16:52,363 INFO L78 Accepts]: Start accepts. Automaton has 11950 states and 20514 transitions. Word has length 121 [2025-01-09 05:16:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:52,365 INFO L471 AbstractCegarLoop]: Abstraction has 11950 states and 20514 transitions. [2025-01-09 05:16:52,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11950 states and 20514 transitions. [2025-01-09 05:16:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:52,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:52,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:52,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:16:52,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:52,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -74226724, now seen corresponding path program 1 times [2025-01-09 05:16:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470252707] [2025-01-09 05:16:52,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:52,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:52,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:52,486 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:16:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:52,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470252707] [2025-01-09 05:16:52,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470252707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:52,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:16:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338180928] [2025-01-09 05:16:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:16:52,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:52,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:16:52,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:16:52,488 INFO L87 Difference]: Start difference. First operand 11950 states and 20514 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:16:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:53,024 INFO L93 Difference]: Finished difference Result 24214 states and 42303 transitions. [2025-01-09 05:16:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:16:53,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:53,075 INFO L225 Difference]: With dead ends: 24214 [2025-01-09 05:16:53,075 INFO L226 Difference]: Without dead ends: 14400 [2025-01-09 05:16:53,104 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:16:53,105 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4467 mSDsluCounter, 8363 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 12597 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:53,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 12597 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:16:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14400 states. [2025-01-09 05:16:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14400 to 11950. [2025-01-09 05:16:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11950 states, 11005 states have (on average 1.6711494775102227) internal successors, (18391), 11219 states have internal predecessors, (18391), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 05:16:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11950 states to 11950 states and 20481 transitions. [2025-01-09 05:16:53,576 INFO L78 Accepts]: Start accepts. Automaton has 11950 states and 20481 transitions. Word has length 121 [2025-01-09 05:16:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 11950 states and 20481 transitions. [2025-01-09 05:16:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:16:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 11950 states and 20481 transitions. [2025-01-09 05:16:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:53,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:53,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:16:53,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1130957926, now seen corresponding path program 1 times [2025-01-09 05:16:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046093296] [2025-01-09 05:16:53,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:53,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:53,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:53,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:53,709 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:16:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:53,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046093296] [2025-01-09 05:16:53,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046093296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:53,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:53,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590342801] [2025-01-09 05:16:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:53,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:53,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:53,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:53,711 INFO L87 Difference]: Start difference. First operand 11950 states and 20481 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:54,831 INFO L93 Difference]: Finished difference Result 35559 states and 61998 transitions. [2025-01-09 05:16:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:54,916 INFO L225 Difference]: With dead ends: 35559 [2025-01-09 05:16:54,916 INFO L226 Difference]: Without dead ends: 25745 [2025-01-09 05:16:54,936 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:16:54,937 INFO L435 NwaCegarLoop]: 4430 mSDtfsCounter, 4869 mSDsluCounter, 13297 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 17727 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:54,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 17727 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:16:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25745 states. [2025-01-09 05:16:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25745 to 23587. [2025-01-09 05:16:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23587 states, 21516 states have (on average 1.6716397099832683) internal successors, (35967), 22184 states have internal predecessors, (35967), 1013 states have call successors, (1013), 390 states have call predecessors, (1013), 1056 states have return successors, (5109), 1076 states have call predecessors, (5109), 1013 states have call successors, (5109) [2025-01-09 05:16:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 42089 transitions. [2025-01-09 05:16:55,784 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 42089 transitions. Word has length 121 [2025-01-09 05:16:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:16:55,785 INFO L471 AbstractCegarLoop]: Abstraction has 23587 states and 42089 transitions. [2025-01-09 05:16:55,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 42089 transitions. [2025-01-09 05:16:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:16:55,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:16:55,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:16:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:16:55,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:16:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:16:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 220427292, now seen corresponding path program 1 times [2025-01-09 05:16:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:16:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049069963] [2025-01-09 05:16:55,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:16:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:16:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:16:55,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:16:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:16:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:16:55,894 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:16:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:16:55,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049069963] [2025-01-09 05:16:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049069963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:16:55,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:16:55,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:16:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112375681] [2025-01-09 05:16:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:16:55,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:16:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:16:55,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:16:55,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:16:55,895 INFO L87 Difference]: Start difference. First operand 23587 states and 42089 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:16:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:16:57,605 INFO L93 Difference]: Finished difference Result 75552 states and 141096 transitions. [2025-01-09 05:16:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:16:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:16:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:16:57,959 INFO L225 Difference]: With dead ends: 75552 [2025-01-09 05:16:57,959 INFO L226 Difference]: Without dead ends: 54101 [2025-01-09 05:16:58,052 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:16:58,053 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4702 mSDsluCounter, 13285 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 17711 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:16:58,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 17711 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:16:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54101 states. [2025-01-09 05:17:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54101 to 50154. [2025-01-09 05:17:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50154 states, 45377 states have (on average 1.6838266081935782) internal successors, (76407), 47439 states have internal predecessors, (76407), 1941 states have call successors, (1941), 774 states have call predecessors, (1941), 2834 states have return successors, (18325), 2068 states have call predecessors, (18325), 1941 states have call successors, (18325) [2025-01-09 05:17:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50154 states to 50154 states and 96673 transitions. [2025-01-09 05:17:00,492 INFO L78 Accepts]: Start accepts. Automaton has 50154 states and 96673 transitions. Word has length 121 [2025-01-09 05:17:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:00,492 INFO L471 AbstractCegarLoop]: Abstraction has 50154 states and 96673 transitions. [2025-01-09 05:17:00,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:17:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 50154 states and 96673 transitions. [2025-01-09 05:17:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:17:00,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:00,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:00,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:17:00,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1398547622, now seen corresponding path program 1 times [2025-01-09 05:17:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014242628] [2025-01-09 05:17:00,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:00,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:17:00,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:17:00,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:00,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:00,603 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:17:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014242628] [2025-01-09 05:17:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014242628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:00,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295663505] [2025-01-09 05:17:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:00,606 INFO L87 Difference]: Start difference. First operand 50154 states and 96673 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:17:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:05,013 INFO L93 Difference]: Finished difference Result 167287 states and 347998 transitions. [2025-01-09 05:17:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-01-09 05:17:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:05,863 INFO L225 Difference]: With dead ends: 167287 [2025-01-09 05:17:05,863 INFO L226 Difference]: Without dead ends: 119269 [2025-01-09 05:17:06,091 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:17:06,092 INFO L435 NwaCegarLoop]: 4424 mSDtfsCounter, 4799 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4822 SdHoareTripleChecker+Valid, 17703 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:06,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4822 Valid, 17703 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:17:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119269 states. [2025-01-09 05:17:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119269 to 112829. [2025-01-09 05:17:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112829 states, 101246 states have (on average 1.7000474092803666) internal successors, (172123), 107554 states have internal predecessors, (172123), 3733 states have call successors, (3733), 1542 states have call predecessors, (3733), 7848 states have return successors, (69269), 3988 states have call predecessors, (69269), 3733 states have call successors, (69269) [2025-01-09 05:17:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112829 states to 112829 states and 245125 transitions. [2025-01-09 05:17:13,048 INFO L78 Accepts]: Start accepts. Automaton has 112829 states and 245125 transitions. Word has length 121 [2025-01-09 05:17:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:13,048 INFO L471 AbstractCegarLoop]: Abstraction has 112829 states and 245125 transitions. [2025-01-09 05:17:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:17:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 112829 states and 245125 transitions. [2025-01-09 05:17:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:17:13,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:13,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:13,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:17:13,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2012910684, now seen corresponding path program 1 times [2025-01-09 05:17:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284625808] [2025-01-09 05:17:13,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:13,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:17:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:17:13,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:13,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:13,217 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:17:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284625808] [2025-01-09 05:17:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284625808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368926702] [2025-01-09 05:17:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:13,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:13,219 INFO L87 Difference]: Start difference. First operand 112829 states and 245125 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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)