./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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_label48+token_ring.13.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '29d311a340ddf06876d5e964efa5bbd1c7e50f9bc9213c2393be8e474d394757'] 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_label48+token_ring.13.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 29d311a340ddf06876d5e964efa5bbd1c7e50f9bc9213c2393be8e474d394757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:09:06,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:09:06,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:09:06,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:09:06,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:09:06,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:09:06,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:09:06,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:09:06,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:09:06,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:09:06,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:09:06,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:09:06,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:09:06,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:09:06,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:09:06,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:09:06,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:09:06,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:09:06,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:09:06,893 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 -> 29d311a340ddf06876d5e964efa5bbd1c7e50f9bc9213c2393be8e474d394757 [2024-11-07 01:09:07,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:09:07,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:09:07,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:09:07,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:09:07,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:09:07,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c [2024-11-07 01:09:08,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:09:08,911 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:09:08,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c [2024-11-07 01:09:08,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42c3dc43e/aaaefbf83b7e45bcbe89974375517632/FLAG9a2e3faef [2024-11-07 01:09:09,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42c3dc43e/aaaefbf83b7e45bcbe89974375517632 [2024-11-07 01:09:09,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:09:09,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:09:09,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:09:09,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:09:09,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:09:09,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:09:09" (1/1) ... [2024-11-07 01:09:09,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b7c98b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:09, skipping insertion in model container [2024-11-07 01:09:09,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:09:09" (1/1) ... [2024-11-07 01:09:09,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:09:10,583 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_label48+token_ring.13.cil-2.c[375709,375722] [2024-11-07 01:09:10,631 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_label48+token_ring.13.cil-2.c[383339,383352] [2024-11-07 01:09:10,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:09:10,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:09:11,334 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_label48+token_ring.13.cil-2.c[375709,375722] [2024-11-07 01:09:11,340 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_label48+token_ring.13.cil-2.c[383339,383352] [2024-11-07 01:09:11,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:09:11,448 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:09:11,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11 WrapperNode [2024-11-07 01:09:11,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:09:11,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:09:11,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:09:11,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:09:11,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:11,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:11,889 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-11-07 01:09:11,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:09:11,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:09:11,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:09:11,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:09:11,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:11,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:11,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,071 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]. [2024-11-07 01:09:12,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,343 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:09:12,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:09:12,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:09:12,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:09:12,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (1/1) ... [2024-11-07 01:09:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:09:12,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:09:12,482 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) [2024-11-07 01:09:12,495 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 [2024-11-07 01:09:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:09:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:09:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:09:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:09:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:09:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:09:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:09:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:09:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:09:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:09:12,514 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:09:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:09:12,515 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:09:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:09:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:09:12,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:09:12,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:09:12,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:09:19,606 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-11-07 01:09:19,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:09:19,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:09:19,664 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 01:09:19,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:09:19 BoogieIcfgContainer [2024-11-07 01:09:19,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:09:19,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:09:19,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:09:19,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:09:19,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:09:09" (1/3) ... [2024-11-07 01:09:19,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:09:19, skipping insertion in model container [2024-11-07 01:09:19,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:09:11" (2/3) ... [2024-11-07 01:09:19,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:09:19, skipping insertion in model container [2024-11-07 01:09:19,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:09:19" (3/3) ... [2024-11-07 01:09:19,674 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.13.cil-2.c [2024-11-07 01:09:19,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:09:19,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:09:19,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:09:19,782 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;@73d76081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:09:19,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:09:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:09:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:19,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:19,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:19,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:19,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -481144573, now seen corresponding path program 1 times [2024-11-07 01:09:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756083351] [2024-11-07 01:09:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:20,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756083351] [2024-11-07 01:09:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756083351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:09:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181384013] [2024-11-07 01:09:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:20,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:09:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:09:20,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:09:20,374 INFO L87 Difference]: Start difference. First operand has 2604 states, 2568 states have (on average 1.837227414330218) internal successors, (4718), 2571 states have internal predecessors, (4718), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:22,502 INFO L93 Difference]: Finished difference Result 5353 states and 9793 transitions. [2024-11-07 01:09:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:09:22,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:22,521 INFO L225 Difference]: With dead ends: 5353 [2024-11-07 01:09:22,522 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 01:09:22,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:09:22,531 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 1125 mSDsluCounter, 12519 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 16925 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:22,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 16925 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:09:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 01:09:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 01:09:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.819744204636291) internal successors, (4553), 2504 states have internal predecessors, (4553), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:09:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4607 transitions. [2024-11-07 01:09:22,677 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4607 transitions. Word has length 189 [2024-11-07 01:09:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:22,678 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4607 transitions. [2024-11-07 01:09:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4607 transitions. [2024-11-07 01:09:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:22,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:22,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:09:22,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1484842181, now seen corresponding path program 1 times [2024-11-07 01:09:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634111710] [2024-11-07 01:09:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634111710] [2024-11-07 01:09:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634111710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:09:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631694027] [2024-11-07 01:09:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:09:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:22,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:09:22,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:09:22,897 INFO L87 Difference]: Start difference. First operand 2537 states and 4607 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:25,180 INFO L93 Difference]: Finished difference Result 3089 states and 5491 transitions. [2024-11-07 01:09:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:09:25,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:25,200 INFO L225 Difference]: With dead ends: 3089 [2024-11-07 01:09:25,203 INFO L226 Difference]: Without dead ends: 2690 [2024-11-07 01:09:25,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:09:25,210 INFO L432 NwaCegarLoop]: 4336 mSDtfsCounter, 1111 mSDsluCounter, 12316 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 16652 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:25,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 16652 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:09:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-07 01:09:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2537. [2024-11-07 01:09:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.8193445243804955) internal successors, (4552), 2504 states have internal predecessors, (4552), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:09:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4606 transitions. [2024-11-07 01:09:25,263 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4606 transitions. Word has length 189 [2024-11-07 01:09:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4606 transitions. [2024-11-07 01:09:25,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4606 transitions. [2024-11-07 01:09:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:25,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:25,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:25,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:09:25,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:25,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1307026809, now seen corresponding path program 1 times [2024-11-07 01:09:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518262370] [2024-11-07 01:09:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518262370] [2024-11-07 01:09:25,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518262370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:25,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:25,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:09:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606074291] [2024-11-07 01:09:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:25,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:09:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:09:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:09:25,532 INFO L87 Difference]: Start difference. First operand 2537 states and 4606 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:28,207 INFO L93 Difference]: Finished difference Result 3653 states and 6401 transitions. [2024-11-07 01:09:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:09:28,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:28,220 INFO L225 Difference]: With dead ends: 3653 [2024-11-07 01:09:28,220 INFO L226 Difference]: Without dead ends: 3258 [2024-11-07 01:09:28,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:09:28,225 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 5646 mSDsluCounter, 12935 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5666 SdHoareTripleChecker+Valid, 17239 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:28,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5666 Valid, 17239 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:09:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-07 01:09:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2953. [2024-11-07 01:09:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2889 states have (on average 1.7871235721703012) internal successors, (5163), 2892 states have internal predecessors, (5163), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-07 01:09:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5264 transitions. [2024-11-07 01:09:28,308 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5264 transitions. Word has length 189 [2024-11-07 01:09:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:28,308 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 5264 transitions. [2024-11-07 01:09:28,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5264 transitions. [2024-11-07 01:09:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:28,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:28,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:09:28,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 711601675, now seen corresponding path program 1 times [2024-11-07 01:09:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650446606] [2024-11-07 01:09:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:28,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650446606] [2024-11-07 01:09:28,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650446606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:28,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925251499] [2024-11-07 01:09:28,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:28,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:28,583 INFO L87 Difference]: Start difference. First operand 2953 states and 5264 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:32,850 INFO L93 Difference]: Finished difference Result 4659 states and 8012 transitions. [2024-11-07 01:09:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:32,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:32,874 INFO L225 Difference]: With dead ends: 4659 [2024-11-07 01:09:32,878 INFO L226 Difference]: Without dead ends: 3848 [2024-11-07 01:09:32,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:32,886 INFO L432 NwaCegarLoop]: 4572 mSDtfsCounter, 5693 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5713 SdHoareTripleChecker+Valid, 22527 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:32,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5713 Valid, 22527 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 01:09:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2024-11-07 01:09:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3340. [2024-11-07 01:09:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3340 states, 3247 states have (on average 1.760394210040037) internal successors, (5716), 3251 states have internal predecessors, (5716), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-07 01:09:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 5863 transitions. [2024-11-07 01:09:33,070 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 5863 transitions. Word has length 189 [2024-11-07 01:09:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:33,071 INFO L471 AbstractCegarLoop]: Abstraction has 3340 states and 5863 transitions. [2024-11-07 01:09:33,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 5863 transitions. [2024-11-07 01:09:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:33,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:33,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:33,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:09:33,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1013006647, now seen corresponding path program 1 times [2024-11-07 01:09:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346642967] [2024-11-07 01:09:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:33,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:33,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346642967] [2024-11-07 01:09:33,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346642967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785945873] [2024-11-07 01:09:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:33,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:33,683 INFO L87 Difference]: Start difference. First operand 3340 states and 5863 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:37,724 INFO L93 Difference]: Finished difference Result 6142 states and 10367 transitions. [2024-11-07 01:09:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:37,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:37,744 INFO L225 Difference]: With dead ends: 6142 [2024-11-07 01:09:37,744 INFO L226 Difference]: Without dead ends: 4944 [2024-11-07 01:09:37,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:37,750 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5687 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:37,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 22525 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:09:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-11-07 01:09:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4118. [2024-11-07 01:09:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 3967 states have (on average 1.7214519788253089) internal successors, (6829), 3973 states have internal predecessors, (6829), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-07 01:09:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 7072 transitions. [2024-11-07 01:09:37,934 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 7072 transitions. Word has length 189 [2024-11-07 01:09:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:37,934 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 7072 transitions. [2024-11-07 01:09:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 7072 transitions. [2024-11-07 01:09:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:37,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:37,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:37,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:09:37,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -442734841, now seen corresponding path program 1 times [2024-11-07 01:09:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558462711] [2024-11-07 01:09:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:38,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558462711] [2024-11-07 01:09:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558462711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:38,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999939469] [2024-11-07 01:09:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:38,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:38,185 INFO L87 Difference]: Start difference. First operand 4118 states and 7072 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:42,225 INFO L93 Difference]: Finished difference Result 9002 states and 14876 transitions. [2024-11-07 01:09:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:42,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:42,257 INFO L225 Difference]: With dead ends: 9002 [2024-11-07 01:09:42,260 INFO L226 Difference]: Without dead ends: 7026 [2024-11-07 01:09:42,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:42,267 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5686 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3811 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5706 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:42,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5706 Valid, 22525 Invalid, 3876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3811 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 01:09:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2024-11-07 01:09:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5675. [2024-11-07 01:09:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5675 states, 5408 states have (on average 1.674371301775148) internal successors, (9055), 5418 states have internal predecessors, (9055), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-07 01:09:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5675 states to 5675 states and 9496 transitions. [2024-11-07 01:09:42,501 INFO L78 Accepts]: Start accepts. Automaton has 5675 states and 9496 transitions. Word has length 189 [2024-11-07 01:09:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 5675 states and 9496 transitions. [2024-11-07 01:09:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5675 states and 9496 transitions. [2024-11-07 01:09:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:42,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:42,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:42,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:09:42,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 961134345, now seen corresponding path program 1 times [2024-11-07 01:09:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:42,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197868406] [2024-11-07 01:09:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:42,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197868406] [2024-11-07 01:09:42,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197868406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:42,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:42,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454351288] [2024-11-07 01:09:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:42,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:42,764 INFO L87 Difference]: Start difference. First operand 5675 states and 9496 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:46,618 INFO L93 Difference]: Finished difference Result 14721 states and 23910 transitions. [2024-11-07 01:09:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:46,684 INFO L225 Difference]: With dead ends: 14721 [2024-11-07 01:09:46,688 INFO L226 Difference]: Without dead ends: 11188 [2024-11-07 01:09:46,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:46,709 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5685 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5705 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:46,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5705 Valid, 22525 Invalid, 3863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3798 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 01:09:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2024-11-07 01:09:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 8796. [2024-11-07 01:09:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8796 states, 8297 states have (on average 1.629143063757985) internal successors, (13517), 8315 states have internal predecessors, (13517), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-07 01:09:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8796 states to 8796 states and 14372 transitions. [2024-11-07 01:09:47,179 INFO L78 Accepts]: Start accepts. Automaton has 8796 states and 14372 transitions. Word has length 189 [2024-11-07 01:09:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:47,180 INFO L471 AbstractCegarLoop]: Abstraction has 8796 states and 14372 transitions. [2024-11-07 01:09:47,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8796 states and 14372 transitions. [2024-11-07 01:09:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:47,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:47,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:47,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:09:47,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:47,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 175136455, now seen corresponding path program 1 times [2024-11-07 01:09:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359291793] [2024-11-07 01:09:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:47,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359291793] [2024-11-07 01:09:47,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359291793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:47,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:47,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:47,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735180320] [2024-11-07 01:09:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:47,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:47,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:47,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:47,541 INFO L87 Difference]: Start difference. First operand 8796 states and 14372 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:51,394 INFO L93 Difference]: Finished difference Result 26160 states and 42040 transitions. [2024-11-07 01:09:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:09:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:51,461 INFO L225 Difference]: With dead ends: 26160 [2024-11-07 01:09:51,461 INFO L226 Difference]: Without dead ends: 19506 [2024-11-07 01:09:51,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:09:51,475 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 5796 mSDsluCounter, 17215 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5816 SdHoareTripleChecker+Valid, 21529 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:51,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5816 Valid, 21529 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:09:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19506 states. [2024-11-07 01:09:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19506 to 15053. [2024-11-07 01:09:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5942512420156139) internal successors, (22463), 14124 states have internal predecessors, (22463), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 01:09:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24200 transitions. [2024-11-07 01:09:51,984 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24200 transitions. Word has length 189 [2024-11-07 01:09:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:51,985 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24200 transitions. [2024-11-07 01:09:51,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24200 transitions. [2024-11-07 01:09:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:51,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:51,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:09:51,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 842518345, now seen corresponding path program 1 times [2024-11-07 01:09:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759641448] [2024-11-07 01:09:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759641448] [2024-11-07 01:09:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759641448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294563780] [2024-11-07 01:09:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:52,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:52,326 INFO L87 Difference]: Start difference. First operand 15053 states and 24200 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:09:54,966 INFO L93 Difference]: Finished difference Result 32698 states and 52633 transitions. [2024-11-07 01:09:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:09:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:09:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:09:55,015 INFO L225 Difference]: With dead ends: 32698 [2024-11-07 01:09:55,015 INFO L226 Difference]: Without dead ends: 19787 [2024-11-07 01:09:55,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:09:55,044 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5194 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:09:55,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 21169 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:09:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19787 states. [2024-11-07 01:09:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19787 to 15053. [2024-11-07 01:09:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15053 states, 14090 states have (on average 1.5919091554293825) internal successors, (22430), 14124 states have internal predecessors, (22430), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 01:09:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 24167 transitions. [2024-11-07 01:09:56,034 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 24167 transitions. Word has length 189 [2024-11-07 01:09:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:09:56,034 INFO L471 AbstractCegarLoop]: Abstraction has 15053 states and 24167 transitions. [2024-11-07 01:09:56,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:09:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 24167 transitions. [2024-11-07 01:09:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:09:56,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:09:56,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:09:56,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:09:56,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:09:56,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:09:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1352710521, now seen corresponding path program 1 times [2024-11-07 01:09:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:09:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020476758] [2024-11-07 01:09:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:09:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:09:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:09:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:09:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:09:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:09:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:09:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:09:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:09:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:09:56,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020476758] [2024-11-07 01:09:56,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020476758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:09:56,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:09:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:09:56,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535486540] [2024-11-07 01:09:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:09:56,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:09:56,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:09:56,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:09:56,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:09:56,317 INFO L87 Difference]: Start difference. First operand 15053 states and 24167 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:00,731 INFO L93 Difference]: Finished difference Result 49005 states and 78262 transitions. [2024-11-07 01:10:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:00,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:10:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:00,989 INFO L225 Difference]: With dead ends: 49005 [2024-11-07 01:10:00,989 INFO L226 Difference]: Without dead ends: 36094 [2024-11-07 01:10:01,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:01,055 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5676 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:01,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 22525 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 01:10:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36094 states. [2024-11-07 01:10:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36094 to 27631. [2024-11-07 01:10:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27631 states, 25740 states have (on average 1.5683760683760684) internal successors, (40370), 25806 states have internal predecessors, (40370), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-07 01:10:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 44033 transitions. [2024-11-07 01:10:02,508 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 44033 transitions. Word has length 189 [2024-11-07 01:10:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 44033 transitions. [2024-11-07 01:10:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 44033 transitions. [2024-11-07 01:10:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:10:02,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:02,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:10:02,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1007882359, now seen corresponding path program 1 times [2024-11-07 01:10:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899539044] [2024-11-07 01:10:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:10:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:10:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:10:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:10:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899539044] [2024-11-07 01:10:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899539044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427253832] [2024-11-07 01:10:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:02,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:02,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:02,738 INFO L87 Difference]: Start difference. First operand 27631 states and 44033 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:08,382 INFO L93 Difference]: Finished difference Result 94765 states and 151582 transitions. [2024-11-07 01:10:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:10:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:08,593 INFO L225 Difference]: With dead ends: 94765 [2024-11-07 01:10:08,593 INFO L226 Difference]: Without dead ends: 69276 [2024-11-07 01:10:08,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:08,657 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5681 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3729 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5701 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:08,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5701 Valid, 22525 Invalid, 3794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3729 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:10:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69276 states. [2024-11-07 01:10:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69276 to 52848. [2024-11-07 01:10:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52848 states, 49101 states have (on average 1.5547544856520235) internal successors, (76340), 49231 states have internal predecessors, (76340), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 01:10:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52848 states to 52848 states and 84341 transitions. [2024-11-07 01:10:11,131 INFO L78 Accepts]: Start accepts. Automaton has 52848 states and 84341 transitions. Word has length 189 [2024-11-07 01:10:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:11,131 INFO L471 AbstractCegarLoop]: Abstraction has 52848 states and 84341 transitions. [2024-11-07 01:10:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 52848 states and 84341 transitions. [2024-11-07 01:10:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:10:11,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:11,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:10:11,151 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:11,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -26927545, now seen corresponding path program 1 times [2024-11-07 01:10:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174843347] [2024-11-07 01:10:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:10:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:10:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:10:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:10:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:11,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174843347] [2024-11-07 01:10:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174843347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:11,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36115100] [2024-11-07 01:10:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:11,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:11,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:11,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:11,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:11,418 INFO L87 Difference]: Start difference. First operand 52848 states and 84341 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:15,616 INFO L93 Difference]: Finished difference Result 120952 states and 195834 transitions. [2024-11-07 01:10:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:10:15,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:10:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:15,856 INFO L225 Difference]: With dead ends: 120952 [2024-11-07 01:10:15,856 INFO L226 Difference]: Without dead ends: 70246 [2024-11-07 01:10:15,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:15,978 INFO L432 NwaCegarLoop]: 4289 mSDtfsCounter, 5198 mSDsluCounter, 16880 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5219 SdHoareTripleChecker+Valid, 21169 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:15,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5219 Valid, 21169 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:10:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70246 states. [2024-11-07 01:10:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70246 to 52848. [2024-11-07 01:10:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52848 states, 49101 states have (on average 1.5521272479175576) internal successors, (76211), 49231 states have internal predecessors, (76211), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 01:10:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52848 states to 52848 states and 84212 transitions. [2024-11-07 01:10:19,006 INFO L78 Accepts]: Start accepts. Automaton has 52848 states and 84212 transitions. Word has length 189 [2024-11-07 01:10:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:19,006 INFO L471 AbstractCegarLoop]: Abstraction has 52848 states and 84212 transitions. [2024-11-07 01:10:19,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 52848 states and 84212 transitions. [2024-11-07 01:10:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 01:10:19,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:19,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:10:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:10:19,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:19,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash -638196603, now seen corresponding path program 1 times [2024-11-07 01:10:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220567481] [2024-11-07 01:10:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:19,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:10:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:10:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:10:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:10:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:10:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220567481] [2024-11-07 01:10:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220567481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095361012] [2024-11-07 01:10:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:19,253 INFO L87 Difference]: Start difference. First operand 52848 states and 84212 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:28,150 INFO L93 Difference]: Finished difference Result 186024 states and 298904 transitions. [2024-11-07 01:10:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 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 189 [2024-11-07 01:10:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:28,670 INFO L225 Difference]: With dead ends: 186024 [2024-11-07 01:10:28,671 INFO L226 Difference]: Without dead ends: 135318 [2024-11-07 01:10:28,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:28,813 INFO L432 NwaCegarLoop]: 4570 mSDtfsCounter, 5669 mSDsluCounter, 17955 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5689 SdHoareTripleChecker+Valid, 22525 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:28,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5689 Valid, 22525 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:10:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135318 states.