./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.10.cil-2.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_label45+token_ring.10.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9ed75528b8d19bd57b9807f295b98ef03135122ab1c9d2a59ccb3a2a66766e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:21:51,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:21:51,977 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:21:51,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:21:51,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:21:52,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:21:52,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:21:52,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:21:52,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:21:52,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:21:52,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:21:52,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:21:52,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:21:52,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:21:52,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:21:52,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:21:52,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:21:52,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:21:52,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:21:52,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:21:52,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:21:52,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:21:52,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:52,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:52,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:52,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:52,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:52,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:21:52,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:21:52,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:21:52,015 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 -> d9ed75528b8d19bd57b9807f295b98ef03135122ab1c9d2a59ccb3a2a66766e0 [2025-01-09 05:21:52,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:21:52,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:21:52,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:21:52,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:21:52,352 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:21:52,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.10.cil-2.c [2025-01-09 05:21:53,709 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1cb9d93/4b33aefbe33247e5abf2f1ab597f65db/FLAGa7f9100c4 [2025-01-09 05:21:54,417 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:21:54,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.10.cil-2.c [2025-01-09 05:21:54,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1cb9d93/4b33aefbe33247e5abf2f1ab597f65db/FLAGa7f9100c4 [2025-01-09 05:21:54,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc1cb9d93/4b33aefbe33247e5abf2f1ab597f65db [2025-01-09 05:21:54,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:21:54,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:21:54,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:54,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:21:54,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:21:54,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:54" (1/1) ... [2025-01-09 05:21:54,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2f9394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:54, skipping insertion in model container [2025-01-09 05:21:54,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:54" (1/1) ... [2025-01-09 05:21:54,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:21:56,130 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_label45+token_ring.10.cil-2.c[380323,380336] [2025-01-09 05:21:56,172 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_label45+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:21:56,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:56,559 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:21:57,299 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_label45+token_ring.10.cil-2.c[380323,380336] [2025-01-09 05:21:57,306 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_label45+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:21:57,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:57,396 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:21:57,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57 WrapperNode [2025-01-09 05:21:57,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:57,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:57,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:21:57,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:21:57,407 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:21:57" (1/1) ... [2025-01-09 05:21:57,486 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:21:57" (1/1) ... [2025-01-09 05:21:57,828 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-01-09 05:21:57,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:57,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:21:57,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:21:57,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:21:57,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:57,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:57,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,074 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:21:58,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:21:58,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:21:58,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:21:58,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:21:58,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 05:21:58,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:58,752 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:21:58,764 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:21:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:21:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:21:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:21:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:21:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:21:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:21:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:21:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:21:58,792 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:21:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:21:58,793 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:21:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:21:58,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:21:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:21:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:21:58,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:21:58,951 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:21:58,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:22:07,158 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-01-09 05:22:07,159 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:22:07,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:22:07,244 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-09 05:22:07,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:07 BoogieIcfgContainer [2025-01-09 05:22:07,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:22:07,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:22:07,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:22:07,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:22:07,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:21:54" (1/3) ... [2025-01-09 05:22:07,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab75d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:07, skipping insertion in model container [2025-01-09 05:22:07,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (2/3) ... [2025-01-09 05:22:07,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab75d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:07, skipping insertion in model container [2025-01-09 05:22:07,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:07" (3/3) ... [2025-01-09 05:22:07,256 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.10.cil-2.c [2025-01-09 05:22:07,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:22:07,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.10.cil-2.c that has 7 procedures, 2513 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-01-09 05:22:07,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:22:07,401 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;@16ea1fd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:22:07,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:22:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:22:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:07,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:07,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:07,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1739200000, now seen corresponding path program 1 times [2025-01-09 05:22:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552274063] [2025-01-09 05:22:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:07,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:07,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:07,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:07,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:07,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:07,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:22:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552274063] [2025-01-09 05:22:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552274063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:22:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192156323] [2025-01-09 05:22:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:07,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:22:07,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:07,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:22:07,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:22:07,939 INFO L87 Difference]: Start difference. First operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:22:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:08,153 INFO L93 Difference]: Finished difference Result 5015 states and 9205 transitions. [2025-01-09 05:22:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:22:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:08,186 INFO L225 Difference]: With dead ends: 5015 [2025-01-09 05:22:08,187 INFO L226 Difference]: Without dead ends: 2446 [2025-01-09 05:22:08,199 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:22:08,204 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 504 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 8558 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:22:08,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 8558 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:22:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-01-09 05:22:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2446. [2025-01-09 05:22:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2414 states have (on average 1.8309859154929577) internal successors, (4420), 2416 states have internal predecessors, (4420), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:22:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4468 transitions. [2025-01-09 05:22:08,391 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4468 transitions. Word has length 154 [2025-01-09 05:22:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:08,393 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4468 transitions. [2025-01-09 05:22:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:22:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4468 transitions. [2025-01-09 05:22:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:08,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:08,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:08,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:22:08,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:08,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2145156930, now seen corresponding path program 1 times [2025-01-09 05:22:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860592082] [2025-01-09 05:22:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:08,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:08,816 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:22:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860592082] [2025-01-09 05:22:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860592082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:08,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:08,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701202263] [2025-01-09 05:22:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:08,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:08,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:08,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:08,821 INFO L87 Difference]: Start difference. First operand 2446 states and 4468 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:09,836 INFO L93 Difference]: Finished difference Result 3124 states and 5561 transitions. [2025-01-09 05:22:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:09,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:09,857 INFO L225 Difference]: With dead ends: 3124 [2025-01-09 05:22:09,858 INFO L226 Difference]: Without dead ends: 2817 [2025-01-09 05:22:09,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:22:09,863 INFO L435 NwaCegarLoop]: 4626 mSDtfsCounter, 4942 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4960 SdHoareTripleChecker+Valid, 18664 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:09,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4960 Valid, 18664 Invalid, 1002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:22:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-01-09 05:22:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2771. [2025-01-09 05:22:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2710 states have (on average 1.8055350553505536) internal successors, (4893), 2714 states have internal predecessors, (4893), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2025-01-09 05:22:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4990 transitions. [2025-01-09 05:22:09,978 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4990 transitions. Word has length 154 [2025-01-09 05:22:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:09,978 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 4990 transitions. [2025-01-09 05:22:09,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4990 transitions. [2025-01-09 05:22:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:09,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:09,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:09,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:22:09,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1860990976, now seen corresponding path program 1 times [2025-01-09 05:22:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541388133] [2025-01-09 05:22:09,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:10,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:10,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:10,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:10,322 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:22:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541388133] [2025-01-09 05:22:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541388133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822782687] [2025-01-09 05:22:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:10,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:10,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:10,325 INFO L87 Difference]: Start difference. First operand 2771 states and 4990 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:11,146 INFO L93 Difference]: Finished difference Result 4106 states and 7142 transitions. [2025-01-09 05:22:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:11,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:11,167 INFO L225 Difference]: With dead ends: 4106 [2025-01-09 05:22:11,168 INFO L226 Difference]: Without dead ends: 3476 [2025-01-09 05:22:11,173 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:22:11,176 INFO L435 NwaCegarLoop]: 4543 mSDtfsCounter, 4938 mSDsluCounter, 13828 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 18371 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:11,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 18371 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:22:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-01-09 05:22:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3411. [2025-01-09 05:22:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 3296 states have (on average 1.7675970873786409) internal successors, (5826), 3304 states have internal predecessors, (5826), 83 states have call successors, (83), 24 states have call predecessors, (83), 30 states have return successors, (106), 86 states have call predecessors, (106), 83 states have call successors, (106) [2025-01-09 05:22:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 6015 transitions. [2025-01-09 05:22:11,318 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 6015 transitions. Word has length 154 [2025-01-09 05:22:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 6015 transitions. [2025-01-09 05:22:11,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 6015 transitions. [2025-01-09 05:22:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:11,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:11,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:11,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:22:11,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:11,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1889103746, now seen corresponding path program 1 times [2025-01-09 05:22:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869349376] [2025-01-09 05:22:11,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:11,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:11,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:11,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:11,565 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:22:11,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869349376] [2025-01-09 05:22:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869349376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749187503] [2025-01-09 05:22:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:11,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:11,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:11,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:11,567 INFO L87 Difference]: Start difference. First operand 3411 states and 6015 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:12,738 INFO L93 Difference]: Finished difference Result 6179 states and 10529 transitions. [2025-01-09 05:22:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:12,781 INFO L225 Difference]: With dead ends: 6179 [2025-01-09 05:22:12,782 INFO L226 Difference]: Without dead ends: 4909 [2025-01-09 05:22:12,788 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:22:12,790 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 4932 mSDsluCounter, 14002 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 18620 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:12,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 18620 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:22:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2025-01-09 05:22:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4807. [2025-01-09 05:22:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 4578 states have (on average 1.726518130187855) internal successors, (7904), 4600 states have internal predecessors, (7904), 159 states have call successors, (159), 48 states have call predecessors, (159), 68 states have return successors, (238), 166 states have call predecessors, (238), 159 states have call successors, (238) [2025-01-09 05:22:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 8301 transitions. [2025-01-09 05:22:13,179 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 8301 transitions. Word has length 154 [2025-01-09 05:22:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 4807 states and 8301 transitions. [2025-01-09 05:22:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 8301 transitions. [2025-01-09 05:22:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:13,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:13,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:22:13,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:13,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1730703424, now seen corresponding path program 1 times [2025-01-09 05:22:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12591224] [2025-01-09 05:22:13,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:13,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:13,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:13,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:13,405 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:22:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12591224] [2025-01-09 05:22:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12591224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445278979] [2025-01-09 05:22:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:13,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:13,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:13,408 INFO L87 Difference]: Start difference. First operand 4807 states and 8301 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:14,317 INFO L93 Difference]: Finished difference Result 10770 states and 18235 transitions. [2025-01-09 05:22:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:14,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:14,367 INFO L225 Difference]: With dead ends: 10770 [2025-01-09 05:22:14,367 INFO L226 Difference]: Without dead ends: 8104 [2025-01-09 05:22:14,383 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:22:14,384 INFO L435 NwaCegarLoop]: 4615 mSDtfsCounter, 4927 mSDsluCounter, 13989 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4945 SdHoareTripleChecker+Valid, 18604 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:14,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4945 Valid, 18604 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:22:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2025-01-09 05:22:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 7931. [2025-01-09 05:22:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7931 states, 7456 states have (on average 1.698766094420601) internal successors, (12666), 7524 states have internal predecessors, (12666), 311 states have call successors, (311), 96 states have call predecessors, (311), 162 states have return successors, (598), 326 states have call predecessors, (598), 311 states have call successors, (598) [2025-01-09 05:22:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 13575 transitions. [2025-01-09 05:22:14,814 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 13575 transitions. Word has length 154 [2025-01-09 05:22:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:14,814 INFO L471 AbstractCegarLoop]: Abstraction has 7931 states and 13575 transitions. [2025-01-09 05:22:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 13575 transitions. [2025-01-09 05:22:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:14,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:14,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:14,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:22:14,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:14,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1616211906, now seen corresponding path program 1 times [2025-01-09 05:22:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449532043] [2025-01-09 05:22:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:14,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:14,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:15,002 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:22:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449532043] [2025-01-09 05:22:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449532043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343855777] [2025-01-09 05:22:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:15,007 INFO L87 Difference]: Start difference. First operand 7931 states and 13575 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:16,121 INFO L93 Difference]: Finished difference Result 21221 states and 36437 transitions. [2025-01-09 05:22:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:16,229 INFO L225 Difference]: With dead ends: 21221 [2025-01-09 05:22:16,229 INFO L226 Difference]: Without dead ends: 15431 [2025-01-09 05:22:16,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:22:16,262 INFO L435 NwaCegarLoop]: 4613 mSDtfsCounter, 4922 mSDsluCounter, 13977 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 18590 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:16,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 18590 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:22:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15431 states. [2025-01-09 05:22:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15431 to 15123. [2025-01-09 05:22:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15123 states, 14102 states have (on average 1.6953623599489434) internal successors, (23908), 14316 states have internal predecessors, (23908), 615 states have call successors, (615), 192 states have call predecessors, (615), 404 states have return successors, (1702), 646 states have call predecessors, (1702), 615 states have call successors, (1702) [2025-01-09 05:22:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 26225 transitions. [2025-01-09 05:22:16,969 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 26225 transitions. Word has length 154 [2025-01-09 05:22:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:16,971 INFO L471 AbstractCegarLoop]: Abstraction has 15123 states and 26225 transitions. [2025-01-09 05:22:16,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 26225 transitions. [2025-01-09 05:22:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:16,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:16,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:22:16,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:16,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1031440256, now seen corresponding path program 1 times [2025-01-09 05:22:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232169096] [2025-01-09 05:22:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:17,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:17,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:17,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:17,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:17,318 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:22:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232169096] [2025-01-09 05:22:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232169096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121986268] [2025-01-09 05:22:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:17,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:17,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:17,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:17,320 INFO L87 Difference]: Start difference. First operand 15123 states and 26225 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:18,876 INFO L93 Difference]: Finished difference Result 45724 states and 81291 transitions. [2025-01-09 05:22:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:19,058 INFO L225 Difference]: With dead ends: 45724 [2025-01-09 05:22:19,058 INFO L226 Difference]: Without dead ends: 32742 [2025-01-09 05:22:19,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:22:19,140 INFO L435 NwaCegarLoop]: 4611 mSDtfsCounter, 4917 mSDsluCounter, 13965 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 18576 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:19,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 18576 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:22:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32742 states. [2025-01-09 05:22:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32742 to 32179. [2025-01-09 05:22:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.713282504012841) internal successors, (51234), 30572 states have internal predecessors, (51234), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:22:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57903 transitions. [2025-01-09 05:22:21,278 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57903 transitions. Word has length 154 [2025-01-09 05:22:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:21,279 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57903 transitions. [2025-01-09 05:22:21,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57903 transitions. [2025-01-09 05:22:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:21,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:21,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:22:21,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 596934658, now seen corresponding path program 1 times [2025-01-09 05:22:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912050127] [2025-01-09 05:22:21,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:21,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:21,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:21,456 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:22:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912050127] [2025-01-09 05:22:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912050127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:21,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:22:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682659481] [2025-01-09 05:22:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:22:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:22:21,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:22:21,462 INFO L87 Difference]: Start difference. First operand 32179 states and 57903 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:22:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:22,900 INFO L93 Difference]: Finished difference Result 73883 states and 137312 transitions. [2025-01-09 05:22:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:22:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:23,142 INFO L225 Difference]: With dead ends: 73883 [2025-01-09 05:22:23,142 INFO L226 Difference]: Without dead ends: 43843 [2025-01-09 05:22:23,265 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:22:23,267 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4644 mSDsluCounter, 8525 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 12855 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:23,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 12855 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:22:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43843 states. [2025-01-09 05:22:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43843 to 32179. [2025-01-09 05:22:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.7111088817549491) internal successors, (51169), 30572 states have internal predecessors, (51169), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:22:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57838 transitions. [2025-01-09 05:22:25,330 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57838 transitions. Word has length 154 [2025-01-09 05:22:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:25,331 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57838 transitions. [2025-01-09 05:22:25,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:22:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57838 transitions. [2025-01-09 05:22:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:25,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:25,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:22:25,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash 167276352, now seen corresponding path program 1 times [2025-01-09 05:22:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306133030] [2025-01-09 05:22:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:25,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:25,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:25,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:25,513 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:22:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306133030] [2025-01-09 05:22:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306133030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949921643] [2025-01-09 05:22:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:25,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:25,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:25,516 INFO L87 Difference]: Start difference. First operand 32179 states and 57838 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:28,418 INFO L93 Difference]: Finished difference Result 103317 states and 193667 transitions. [2025-01-09 05:22:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:28,835 INFO L225 Difference]: With dead ends: 103317 [2025-01-09 05:22:28,836 INFO L226 Difference]: Without dead ends: 73279 [2025-01-09 05:22:28,937 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:22:28,938 INFO L435 NwaCegarLoop]: 4600 mSDtfsCounter, 4901 mSDsluCounter, 13920 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 18520 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:28,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 18520 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:22:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73279 states. [2025-01-09 05:22:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73279 to 72367. [2025-01-09 05:22:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72367 states, 67098 states have (on average 1.7350591671882918) internal successors, (116419), 69160 states have internal predecessors, (116419), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 2828 states have return successors, (19078), 2566 states have call predecessors, (19078), 2439 states have call successors, (19078) [2025-01-09 05:22:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72367 states to 72367 states and 137936 transitions. [2025-01-09 05:22:32,257 INFO L78 Accepts]: Start accepts. Automaton has 72367 states and 137936 transitions. Word has length 154 [2025-01-09 05:22:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:32,258 INFO L471 AbstractCegarLoop]: Abstraction has 72367 states and 137936 transitions. [2025-01-09 05:22:32,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 72367 states and 137936 transitions. [2025-01-09 05:22:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:32,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:32,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:32,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:22:32,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:32,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:32,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1114314238, now seen corresponding path program 1 times [2025-01-09 05:22:32,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:32,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575037424] [2025-01-09 05:22:32,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:32,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:32,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:32,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:32,466 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:22:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575037424] [2025-01-09 05:22:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575037424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890460170] [2025-01-09 05:22:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:32,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:32,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:32,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:32,468 INFO L87 Difference]: Start difference. First operand 72367 states and 137936 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:22:38,526 INFO L93 Difference]: Finished difference Result 242868 states and 492137 transitions. [2025-01-09 05:22:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:22:38,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 154 [2025-01-09 05:22:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:22:39,706 INFO L225 Difference]: With dead ends: 242868 [2025-01-09 05:22:39,706 INFO L226 Difference]: Without dead ends: 172642 [2025-01-09 05:22:39,887 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:22:39,887 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 4897 mSDsluCounter, 13769 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4915 SdHoareTripleChecker+Valid, 18305 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:22:39,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4915 Valid, 18305 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:22:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172642 states. [2025-01-09 05:22:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172642 to 170963. [2025-01-09 05:22:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170963 states, 158248 states have (on average 1.7625562408371669) internal successors, (278921), 164556 states have internal predecessors, (278921), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 7842 states have return successors, (70918), 5126 states have call predecessors, (70918), 4871 states have call successors, (70918) [2025-01-09 05:22:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170963 states to 170963 states and 354710 transitions. [2025-01-09 05:22:50,252 INFO L78 Accepts]: Start accepts. Automaton has 170963 states and 354710 transitions. Word has length 154 [2025-01-09 05:22:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:22:50,253 INFO L471 AbstractCegarLoop]: Abstraction has 170963 states and 354710 transitions. [2025-01-09 05:22:50,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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:22:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 170963 states and 354710 transitions. [2025-01-09 05:22:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:22:50,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:22:50,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:22:50,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:22:50,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:22:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:22:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1976147840, now seen corresponding path program 1 times [2025-01-09 05:22:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:22:50,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315662303] [2025-01-09 05:22:50,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:22:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:22:50,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:22:50,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:22:50,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:22:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:22:50,451 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:22:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:22:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315662303] [2025-01-09 05:22:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315662303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:22:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:22:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:22:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954834513] [2025-01-09 05:22:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:22:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:22:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:22:50,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:22:50,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:22:50,454 INFO L87 Difference]: Start difference. First operand 170963 states and 354710 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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)