./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.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', '4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4'] 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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.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 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:24:38,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:24:38,426 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:24:38,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:24:38,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:24:38,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:24:38,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:24:38,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:24:38,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:24:38,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:24:38,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:24:38,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:24:38,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:24:38,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:24:38,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:24:38,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:24:38,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:24:38,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:24:38,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:24:38,445 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 -> 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 [2024-11-07 01:24:38,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:24:38,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:24:38,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:24:38,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:24:38,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:24:38,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2024-11-07 01:24:39,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:24:40,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:24:40,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2024-11-07 01:24:40,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e0471e9e/47892c818935439a8d0094fa5b65af2f/FLAGf73701bc2 [2024-11-07 01:24:40,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e0471e9e/47892c818935439a8d0094fa5b65af2f [2024-11-07 01:24:40,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:24:40,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:24:40,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:24:40,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:24:40,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:24:40,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:24:40" (1/1) ... [2024-11-07 01:24:40,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1807eea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:40, skipping insertion in model container [2024-11-07 01:24:40,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:24:40" (1/1) ... [2024-11-07 01:24:40,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:24:40,725 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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c[6354,6367] [2024-11-07 01:24:40,760 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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c[9171,9184] [2024-11-07 01:24:41,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:24:41,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:24:41,184 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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c[6354,6367] [2024-11-07 01:24:41,191 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/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c[9171,9184] [2024-11-07 01:24:41,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:24:41,439 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:24:41,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41 WrapperNode [2024-11-07 01:24:41,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:24:41,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:24:41,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:24:41,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:24:41,445 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:24:41" (1/1) ... [2024-11-07 01:24:41,502 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:24:41" (1/1) ... [2024-11-07 01:24:41,790 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4983 [2024-11-07 01:24:41,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:24:41,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:24:41,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:24:41,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:24:41,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:41,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:41,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:41,983 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:24:41,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:41,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:24:42,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:24:42,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:24:42,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:24:42,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (1/1) ... [2024-11-07 01:24:42,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:24:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:24:42,332 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:24:42,333 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:24:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:24:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:24:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:24:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:24:42,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:24:42,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:24:45,906 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-11-07 01:24:45,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:24:45,926 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:24:45,927 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:24:45,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:24:45 BoogieIcfgContainer [2024-11-07 01:24:45,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:24:45,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:24:45,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:24:45,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:24:45,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:24:40" (1/3) ... [2024-11-07 01:24:45,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eae4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:24:45, skipping insertion in model container [2024-11-07 01:24:45,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:24:41" (2/3) ... [2024-11-07 01:24:45,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13eae4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:24:45, skipping insertion in model container [2024-11-07 01:24:45,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:24:45" (3/3) ... [2024-11-07 01:24:45,934 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2024-11-07 01:24:45,944 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:24:45,944 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:24:45,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:24:45,998 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;@267675e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:24:45,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:24:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:24:46,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:46,010 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] [2024-11-07 01:24:46,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:46,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1537187155, now seen corresponding path program 1 times [2024-11-07 01:24:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:46,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452369654] [2024-11-07 01:24:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:46,139 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:24:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452369654] [2024-11-07 01:24:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452369654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:24:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557738783] [2024-11-07 01:24:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:46,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:24:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:46,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:24:46,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:24:46,158 INFO L87 Difference]: Start difference. First operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:46,214 INFO L93 Difference]: Finished difference Result 1722 states and 3274 transitions. [2024-11-07 01:24:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:24:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:24:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:46,224 INFO L225 Difference]: With dead ends: 1722 [2024-11-07 01:24:46,224 INFO L226 Difference]: Without dead ends: 806 [2024-11-07 01:24:46,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:24:46,230 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:46,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-07 01:24:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2024-11-07 01:24:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2024-11-07 01:24:46,282 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2024-11-07 01:24:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:46,282 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2024-11-07 01:24:46,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2024-11-07 01:24:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:24:46,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:46,283 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] [2024-11-07 01:24:46,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:24:46,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:46,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662891, now seen corresponding path program 1 times [2024-11-07 01:24:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:46,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181590408] [2024-11-07 01:24:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:46,414 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:24:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181590408] [2024-11-07 01:24:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181590408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489678026] [2024-11-07 01:24:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:46,417 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:46,511 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2024-11-07 01:24:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:24:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:46,515 INFO L225 Difference]: With dead ends: 870 [2024-11-07 01:24:46,519 INFO L226 Difference]: Without dead ends: 836 [2024-11-07 01:24:46,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:46,520 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:46,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-07 01:24:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2024-11-07 01:24:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2024-11-07 01:24:46,545 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2024-11-07 01:24:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2024-11-07 01:24:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2024-11-07 01:24:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 01:24:46,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:46,546 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] [2024-11-07 01:24:46,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:24:46,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1523119221, now seen corresponding path program 1 times [2024-11-07 01:24:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122620669] [2024-11-07 01:24:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:46,633 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:24:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122620669] [2024-11-07 01:24:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122620669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:24:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041620978] [2024-11-07 01:24:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:46,634 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:49,756 INFO L93 Difference]: Finished difference Result 2310 states and 4381 transitions. [2024-11-07 01:24:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 01:24:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:49,762 INFO L225 Difference]: With dead ends: 2310 [2024-11-07 01:24:49,763 INFO L226 Difference]: Without dead ends: 1557 [2024-11-07 01:24:49,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:49,765 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 846 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:49,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 544 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 01:24:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2024-11-07 01:24:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2024-11-07 01:24:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.5993569131832797) internal successors, (2487), 1556 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2487 transitions. [2024-11-07 01:24:49,802 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2487 transitions. Word has length 24 [2024-11-07 01:24:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:49,802 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2487 transitions. [2024-11-07 01:24:49,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2487 transitions. [2024-11-07 01:24:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 01:24:49,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:49,803 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] [2024-11-07 01:24:49,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:24:49,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 623816355, now seen corresponding path program 1 times [2024-11-07 01:24:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572128034] [2024-11-07 01:24:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:49,891 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:24:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572128034] [2024-11-07 01:24:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572128034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506273045] [2024-11-07 01:24:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:49,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:49,892 INFO L87 Difference]: Start difference. First operand 1557 states and 2487 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:49,989 INFO L93 Difference]: Finished difference Result 1737 states and 2769 transitions. [2024-11-07 01:24:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:24:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 01:24:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:49,999 INFO L225 Difference]: With dead ends: 1737 [2024-11-07 01:24:50,000 INFO L226 Difference]: Without dead ends: 1707 [2024-11-07 01:24:50,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:24:50,001 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-07 01:24:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1585. [2024-11-07 01:24:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.5988629185091598) internal successors, (2531), 1584 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2531 transitions. [2024-11-07 01:24:50,039 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2531 transitions. Word has length 35 [2024-11-07 01:24:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,039 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2531 transitions. [2024-11-07 01:24:50,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2531 transitions. [2024-11-07 01:24:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:24:50,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,041 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] [2024-11-07 01:24:50,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:24:50,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1071361683, now seen corresponding path program 1 times [2024-11-07 01:24:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664776966] [2024-11-07 01:24:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,103 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:24:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664776966] [2024-11-07 01:24:50,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664776966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709984724] [2024-11-07 01:24:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,104 INFO L87 Difference]: Start difference. First operand 1585 states and 2531 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:50,140 INFO L93 Difference]: Finished difference Result 1690 states and 2694 transitions. [2024-11-07 01:24:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:50,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:24:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:50,145 INFO L225 Difference]: With dead ends: 1690 [2024-11-07 01:24:50,145 INFO L226 Difference]: Without dead ends: 1632 [2024-11-07 01:24:50,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,147 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-07 01:24:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-11-07 01:24:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5964373464373465) internal successors, (2599), 1629 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2599 transitions. [2024-11-07 01:24:50,179 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2599 transitions. Word has length 37 [2024-11-07 01:24:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2599 transitions. [2024-11-07 01:24:50,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2599 transitions. [2024-11-07 01:24:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:24:50,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,181 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] [2024-11-07 01:24:50,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:24:50,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1137855195, now seen corresponding path program 1 times [2024-11-07 01:24:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024337343] [2024-11-07 01:24:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,340 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:24:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024337343] [2024-11-07 01:24:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024337343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295258028] [2024-11-07 01:24:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:50,342 INFO L87 Difference]: Start difference. First operand 1630 states and 2599 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:50,430 INFO L93 Difference]: Finished difference Result 1735 states and 2759 transitions. [2024-11-07 01:24:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:24:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:50,436 INFO L225 Difference]: With dead ends: 1735 [2024-11-07 01:24:50,436 INFO L226 Difference]: Without dead ends: 1632 [2024-11-07 01:24:50,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:24:50,437 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 2946 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1592 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-11-07 01:24:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2024-11-07 01:24:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.5952088452088453) internal successors, (2597), 1629 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2597 transitions. [2024-11-07 01:24:50,504 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2597 transitions. Word has length 37 [2024-11-07 01:24:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2597 transitions. [2024-11-07 01:24:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2597 transitions. [2024-11-07 01:24:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 01:24:50,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,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] [2024-11-07 01:24:50,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:24:50,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 499049456, now seen corresponding path program 1 times [2024-11-07 01:24:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173402417] [2024-11-07 01:24:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,645 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:24:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173402417] [2024-11-07 01:24:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173402417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816561772] [2024-11-07 01:24:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:50,646 INFO L87 Difference]: Start difference. First operand 1630 states and 2597 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:50,698 INFO L93 Difference]: Finished difference Result 1638 states and 2606 transitions. [2024-11-07 01:24:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 01:24:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:50,703 INFO L225 Difference]: With dead ends: 1638 [2024-11-07 01:24:50,703 INFO L226 Difference]: Without dead ends: 1636 [2024-11-07 01:24:50,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:50,704 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6011 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-11-07 01:24:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2024-11-07 01:24:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.5924112607099143) internal successors, (2602), 1635 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2602 transitions. [2024-11-07 01:24:50,729 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2602 transitions. Word has length 38 [2024-11-07 01:24:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,729 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2602 transitions. [2024-11-07 01:24:50,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2602 transitions. [2024-11-07 01:24:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:24:50,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,730 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] [2024-11-07 01:24:50,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:24:50,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 166228827, now seen corresponding path program 1 times [2024-11-07 01:24:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541011739] [2024-11-07 01:24:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,774 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:24:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541011739] [2024-11-07 01:24:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541011739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6195487] [2024-11-07 01:24:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,776 INFO L87 Difference]: Start difference. First operand 1636 states and 2602 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:50,804 INFO L93 Difference]: Finished difference Result 1758 states and 2783 transitions. [2024-11-07 01:24:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:24:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:50,809 INFO L225 Difference]: With dead ends: 1758 [2024-11-07 01:24:50,809 INFO L226 Difference]: Without dead ends: 1694 [2024-11-07 01:24:50,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,810 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-07 01:24:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1692. [2024-11-07 01:24:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 1.5875739644970415) internal successors, (2683), 1691 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2683 transitions. [2024-11-07 01:24:50,835 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2683 transitions. Word has length 39 [2024-11-07 01:24:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,835 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 2683 transitions. [2024-11-07 01:24:50,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2683 transitions. [2024-11-07 01:24:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:24:50,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,836 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] [2024-11-07 01:24:50,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:24:50,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2049239973, now seen corresponding path program 1 times [2024-11-07 01:24:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559968554] [2024-11-07 01:24:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,896 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:24:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559968554] [2024-11-07 01:24:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559968554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184362294] [2024-11-07 01:24:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,897 INFO L87 Difference]: Start difference. First operand 1692 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:50,921 INFO L93 Difference]: Finished difference Result 1994 states and 3123 transitions. [2024-11-07 01:24:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:24:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:50,926 INFO L225 Difference]: With dead ends: 1994 [2024-11-07 01:24:50,926 INFO L226 Difference]: Without dead ends: 1831 [2024-11-07 01:24:50,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,927 INFO L432 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:50,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-07 01:24:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2024-11-07 01:24:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1827 states have (on average 1.5736179529282976) internal successors, (2875), 1828 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2875 transitions. [2024-11-07 01:24:50,956 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2875 transitions. Word has length 39 [2024-11-07 01:24:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2875 transitions. [2024-11-07 01:24:50,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2875 transitions. [2024-11-07 01:24:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:24:50,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:50,957 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] [2024-11-07 01:24:50,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:24:50,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -268307109, now seen corresponding path program 1 times [2024-11-07 01:24:50,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629660341] [2024-11-07 01:24:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:50,997 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:24:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:50,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629660341] [2024-11-07 01:24:50,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629660341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:50,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866375495] [2024-11-07 01:24:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:50,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:50,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:50,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:50,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:50,998 INFO L87 Difference]: Start difference. First operand 1829 states and 2875 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:51,027 INFO L93 Difference]: Finished difference Result 2381 states and 3657 transitions. [2024-11-07 01:24:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:24:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:51,034 INFO L225 Difference]: With dead ends: 2381 [2024-11-07 01:24:51,034 INFO L226 Difference]: Without dead ends: 2081 [2024-11-07 01:24:51,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:51,036 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:51,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-11-07 01:24:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2079. [2024-11-07 01:24:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.5459797785267213) internal successors, (3211), 2078 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3211 transitions. [2024-11-07 01:24:51,070 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3211 transitions. Word has length 39 [2024-11-07 01:24:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:51,070 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3211 transitions. [2024-11-07 01:24:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3211 transitions. [2024-11-07 01:24:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:24:51,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:51,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:24:51,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:51,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1567417933, now seen corresponding path program 1 times [2024-11-07 01:24:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385763453] [2024-11-07 01:24:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:24:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385763453] [2024-11-07 01:24:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385763453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:51,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:51,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915382860] [2024-11-07 01:24:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:51,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:51,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:51,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:51,159 INFO L87 Difference]: Start difference. First operand 2079 states and 3211 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:51,254 INFO L93 Difference]: Finished difference Result 3711 states and 5487 transitions. [2024-11-07 01:24:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:24:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:51,264 INFO L225 Difference]: With dead ends: 3711 [2024-11-07 01:24:51,264 INFO L226 Difference]: Without dead ends: 3309 [2024-11-07 01:24:51,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:24:51,266 INFO L432 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:51,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-07 01:24:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2024-11-07 01:24:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.5146886016451233) internal successors, (3867), 2554 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3867 transitions. [2024-11-07 01:24:51,314 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3867 transitions. Word has length 54 [2024-11-07 01:24:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:51,314 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 3867 transitions. [2024-11-07 01:24:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3867 transitions. [2024-11-07 01:24:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:24:51,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:51,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:24:51,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -648050867, now seen corresponding path program 1 times [2024-11-07 01:24:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865005485] [2024-11-07 01:24:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:24:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865005485] [2024-11-07 01:24:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865005485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347441513] [2024-11-07 01:24:51,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:51,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:51,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:51,418 INFO L87 Difference]: Start difference. First operand 2555 states and 3867 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:51,521 INFO L93 Difference]: Finished difference Result 4259 states and 6247 transitions. [2024-11-07 01:24:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:24:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:51,532 INFO L225 Difference]: With dead ends: 4259 [2024-11-07 01:24:51,532 INFO L226 Difference]: Without dead ends: 3709 [2024-11-07 01:24:51,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:24:51,534 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:51,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-11-07 01:24:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2024-11-07 01:24:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.4828839745531657) internal successors, (4895), 3302 states have internal predecessors, (4895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4895 transitions. [2024-11-07 01:24:51,596 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4895 transitions. Word has length 54 [2024-11-07 01:24:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:51,596 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4895 transitions. [2024-11-07 01:24:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4895 transitions. [2024-11-07 01:24:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:24:51,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:51,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:24:51,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1132881997, now seen corresponding path program 1 times [2024-11-07 01:24:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511541933] [2024-11-07 01:24:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:24:51,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511541933] [2024-11-07 01:24:51,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511541933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:51,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:24:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656834291] [2024-11-07 01:24:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:24:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:24:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:24:51,676 INFO L87 Difference]: Start difference. First operand 3303 states and 4895 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:51,811 INFO L93 Difference]: Finished difference Result 4807 states and 7003 transitions. [2024-11-07 01:24:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:24:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:24:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:51,823 INFO L225 Difference]: With dead ends: 4807 [2024-11-07 01:24:51,823 INFO L226 Difference]: Without dead ends: 4257 [2024-11-07 01:24:51,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:24:51,825 INFO L432 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:51,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:24:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2024-11-07 01:24:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2024-11-07 01:24:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.4681735515718368) internal successors, (5651), 3850 states have internal predecessors, (5651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5651 transitions. [2024-11-07 01:24:51,900 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5651 transitions. Word has length 54 [2024-11-07 01:24:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:51,900 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5651 transitions. [2024-11-07 01:24:51,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5651 transitions. [2024-11-07 01:24:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 01:24:51,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:51,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:24:51,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1336470191, now seen corresponding path program 1 times [2024-11-07 01:24:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99055681] [2024-11-07 01:24:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99055681] [2024-11-07 01:24:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99055681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:51,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953385189] [2024-11-07 01:24:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:51,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:51,981 INFO L87 Difference]: Start difference. First operand 3851 states and 5651 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:52,028 INFO L93 Difference]: Finished difference Result 6175 states and 8861 transitions. [2024-11-07 01:24:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 01:24:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:52,041 INFO L225 Difference]: With dead ends: 6175 [2024-11-07 01:24:52,041 INFO L226 Difference]: Without dead ends: 3853 [2024-11-07 01:24:52,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:52,048 INFO L432 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:52,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-07 01:24:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2024-11-07 01:24:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.4551831644583009) internal successors, (5601), 3850 states have internal predecessors, (5601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5601 transitions. [2024-11-07 01:24:52,113 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5601 transitions. Word has length 55 [2024-11-07 01:24:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:52,114 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5601 transitions. [2024-11-07 01:24:52,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5601 transitions. [2024-11-07 01:24:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 01:24:52,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:52,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:52,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:24:52,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1355833083, now seen corresponding path program 1 times [2024-11-07 01:24:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:52,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769093783] [2024-11-07 01:24:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769093783] [2024-11-07 01:24:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769093783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137878463] [2024-11-07 01:24:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:52,178 INFO L87 Difference]: Start difference. First operand 3851 states and 5601 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:52,201 INFO L93 Difference]: Finished difference Result 4770 states and 6861 transitions. [2024-11-07 01:24:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 01:24:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:52,205 INFO L225 Difference]: With dead ends: 4770 [2024-11-07 01:24:52,205 INFO L226 Difference]: Without dead ends: 2448 [2024-11-07 01:24:52,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:52,207 INFO L432 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:52,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-07 01:24:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2024-11-07 01:24:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.5077932731747334) internal successors, (3676), 2439 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3676 transitions. [2024-11-07 01:24:52,234 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3676 transitions. Word has length 56 [2024-11-07 01:24:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3676 transitions. [2024-11-07 01:24:52,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3676 transitions. [2024-11-07 01:24:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 01:24:52,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:52,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:24:52,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1597882527, now seen corresponding path program 1 times [2024-11-07 01:24:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673233078] [2024-11-07 01:24:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:52,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673233078] [2024-11-07 01:24:52,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673233078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:24:52,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:24:52,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:24:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671814057] [2024-11-07 01:24:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:24:52,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:24:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:24:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:52,290 INFO L87 Difference]: Start difference. First operand 2440 states and 3676 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:52,308 INFO L93 Difference]: Finished difference Result 2894 states and 4290 transitions. [2024-11-07 01:24:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:24:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 01:24:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:52,311 INFO L225 Difference]: With dead ends: 2894 [2024-11-07 01:24:52,311 INFO L226 Difference]: Without dead ends: 1992 [2024-11-07 01:24:52,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:24:52,313 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:52,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-07 01:24:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2024-11-07 01:24:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.5367203219315895) internal successors, (3055), 1989 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3055 transitions. [2024-11-07 01:24:52,333 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3055 transitions. Word has length 57 [2024-11-07 01:24:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:52,334 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3055 transitions. [2024-11-07 01:24:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3055 transitions. [2024-11-07 01:24:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:24:52,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:52,334 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:52,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:24:52,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1649038701, now seen corresponding path program 1 times [2024-11-07 01:24:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955440962] [2024-11-07 01:24:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:24:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:52,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955440962] [2024-11-07 01:24:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955440962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:24:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788755440] [2024-11-07 01:24:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:24:52,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:24:52,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:24:52,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:24:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:52,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 01:24:52,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:24:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:24:52,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:24:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:24:52,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788755440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:24:52,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:24:52,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2024-11-07 01:24:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829694212] [2024-11-07 01:24:52,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:24:52,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:24:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:24:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:24:52,842 INFO L87 Difference]: Start difference. First operand 1990 states and 3055 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:52,947 INFO L93 Difference]: Finished difference Result 3052 states and 4449 transitions. [2024-11-07 01:24:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:24:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 01:24:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:52,951 INFO L225 Difference]: With dead ends: 3052 [2024-11-07 01:24:52,951 INFO L226 Difference]: Without dead ends: 2600 [2024-11-07 01:24:52,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:24:52,953 INFO L432 NwaCegarLoop]: 1516 mSDtfsCounter, 4407 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4407 SdHoareTripleChecker+Valid, 6184 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:52,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4407 Valid, 6184 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:24:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-11-07 01:24:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2545. [2024-11-07 01:24:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.4691309476995675) internal successors, (3736), 2544 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3736 transitions. [2024-11-07 01:24:52,992 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3736 transitions. Word has length 59 [2024-11-07 01:24:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3736 transitions. [2024-11-07 01:24:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3736 transitions. [2024-11-07 01:24:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:24:52,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:52,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:24:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 01:24:53,194 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:53,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1651307681, now seen corresponding path program 1 times [2024-11-07 01:24:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914042406] [2024-11-07 01:24:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:54,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914042406] [2024-11-07 01:24:54,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914042406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:24:54,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588123116] [2024-11-07 01:24:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:54,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:24:54,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:24:54,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:24:54,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:24:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:54,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 01:24:54,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:24:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:54,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:24:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588123116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:24:55,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:24:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-11-07 01:24:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685483386] [2024-11-07 01:24:55,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:24:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 01:24:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 01:24:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:24:55,021 INFO L87 Difference]: Start difference. First operand 2545 states and 3736 transitions. Second operand has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:24:55,467 INFO L93 Difference]: Finished difference Result 4485 states and 6229 transitions. [2024-11-07 01:24:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:24:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:24:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:24:55,473 INFO L225 Difference]: With dead ends: 4485 [2024-11-07 01:24:55,473 INFO L226 Difference]: Without dead ends: 3576 [2024-11-07 01:24:55,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 01:24:55,476 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 21049 mSDsluCounter, 6141 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21049 SdHoareTripleChecker+Valid, 7632 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:24:55,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21049 Valid, 7632 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:24:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3576 states. [2024-11-07 01:24:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3576 to 3538. [2024-11-07 01:24:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3536 states have (on average 1.4038461538461537) internal successors, (4964), 3537 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 4964 transitions. [2024-11-07 01:24:55,583 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 4964 transitions. Word has length 60 [2024-11-07 01:24:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:24:55,583 INFO L471 AbstractCegarLoop]: Abstraction has 3538 states and 4964 transitions. [2024-11-07 01:24:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:24:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 4964 transitions. [2024-11-07 01:24:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:24:55,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:24:55,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:55,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:24:55,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 01:24:55,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:24:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:24:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1955522029, now seen corresponding path program 1 times [2024-11-07 01:24:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:24:55,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961203111] [2024-11-07 01:24:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:55,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:24:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:24:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961203111] [2024-11-07 01:24:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961203111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:24:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718329034] [2024-11-07 01:24:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:24:56,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:24:56,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:24:56,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:24:56,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:24:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:24:56,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 01:24:56,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:24:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:57,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:24:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:24:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718329034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:24:58,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:24:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 37 [2024-11-07 01:24:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048707338] [2024-11-07 01:24:58,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:24:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 01:24:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:24:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 01:24:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 01:24:58,826 INFO L87 Difference]: Start difference. First operand 3538 states and 4964 transitions. Second operand has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:16,376 INFO L93 Difference]: Finished difference Result 12879 states and 16841 transitions. [2024-11-07 01:25:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-07 01:25:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:25:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:16,393 INFO L225 Difference]: With dead ends: 12879 [2024-11-07 01:25:16,393 INFO L226 Difference]: Without dead ends: 11031 [2024-11-07 01:25:16,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12082 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=5773, Invalid=25733, Unknown=0, NotChecked=0, Total=31506 [2024-11-07 01:25:16,402 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 19058 mSDsluCounter, 17828 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19058 SdHoareTripleChecker+Valid, 19375 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:16,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19058 Valid, 19375 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:25:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11031 states. [2024-11-07 01:25:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11031 to 8275. [2024-11-07 01:25:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8275 states, 8273 states have (on average 1.3140336032878037) internal successors, (10871), 8274 states have internal predecessors, (10871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 10871 transitions. [2024-11-07 01:25:16,588 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 10871 transitions. Word has length 60 [2024-11-07 01:25:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 8275 states and 10871 transitions. [2024-11-07 01:25:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.27027027027027) internal successors, (158), 37 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 10871 transitions. [2024-11-07 01:25:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 01:25:16,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:16,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:16,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 01:25:16,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:16,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -909285249, now seen corresponding path program 1 times [2024-11-07 01:25:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097308161] [2024-11-07 01:25:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:17,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:17,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097308161] [2024-11-07 01:25:17,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097308161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:17,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077361020] [2024-11-07 01:25:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:17,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:17,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:25:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:17,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 01:25:17,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:17,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:25:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077361020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:25:17,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:25:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-07 01:25:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318732890] [2024-11-07 01:25:17,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:25:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 01:25:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 01:25:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:25:17,901 INFO L87 Difference]: Start difference. First operand 8275 states and 10871 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:18,396 INFO L93 Difference]: Finished difference Result 15813 states and 20365 transitions. [2024-11-07 01:25:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:25:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-07 01:25:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:18,411 INFO L225 Difference]: With dead ends: 15813 [2024-11-07 01:25:18,411 INFO L226 Difference]: Without dead ends: 9671 [2024-11-07 01:25:18,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 01:25:18,416 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 10579 mSDsluCounter, 6120 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10579 SdHoareTripleChecker+Valid, 7617 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:18,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10579 Valid, 7617 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:25:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2024-11-07 01:25:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9623. [2024-11-07 01:25:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9623 states, 9621 states have (on average 1.2965388213283442) internal successors, (12474), 9622 states have internal predecessors, (12474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9623 states to 9623 states and 12474 transitions. [2024-11-07 01:25:18,706 INFO L78 Accepts]: Start accepts. Automaton has 9623 states and 12474 transitions. Word has length 61 [2024-11-07 01:25:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 9623 states and 12474 transitions. [2024-11-07 01:25:18,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9623 states and 12474 transitions. [2024-11-07 01:25:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:25:18,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:18,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:18,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:25:18,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:18,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:18,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 705601745, now seen corresponding path program 1 times [2024-11-07 01:25:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524256734] [2024-11-07 01:25:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:19,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524256734] [2024-11-07 01:25:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524256734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:19,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401119925] [2024-11-07 01:25:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:19,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:19,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:25:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:19,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 01:25:19,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:20,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:25:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401119925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:25:21,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:25:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 41 [2024-11-07 01:25:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641340195] [2024-11-07 01:25:21,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:25:21,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-07 01:25:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-07 01:25:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 01:25:21,555 INFO L87 Difference]: Start difference. First operand 9623 states and 12474 transitions. Second operand has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:29,307 INFO L93 Difference]: Finished difference Result 13553 states and 17397 transitions. [2024-11-07 01:25:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-07 01:25:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 01:25:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:29,344 INFO L225 Difference]: With dead ends: 13553 [2024-11-07 01:25:29,348 INFO L226 Difference]: Without dead ends: 9767 [2024-11-07 01:25:29,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2423, Invalid=8919, Unknown=0, NotChecked=0, Total=11342 [2024-11-07 01:25:29,364 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 17777 mSDsluCounter, 21076 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17777 SdHoareTripleChecker+Valid, 22647 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:29,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17777 Valid, 22647 Invalid, 2235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:25:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-07 01:25:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 8191. [2024-11-07 01:25:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8191 states, 8189 states have (on average 1.3040664305776042) internal successors, (10679), 8190 states have internal predecessors, (10679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8191 states to 8191 states and 10679 transitions. [2024-11-07 01:25:29,864 INFO L78 Accepts]: Start accepts. Automaton has 8191 states and 10679 transitions. Word has length 62 [2024-11-07 01:25:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 8191 states and 10679 transitions. [2024-11-07 01:25:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.8048780487804876) internal successors, (156), 41 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8191 states and 10679 transitions. [2024-11-07 01:25:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 01:25:29,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:29,870 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:25:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:30,071 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1645833661, now seen corresponding path program 1 times [2024-11-07 01:25:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533946001] [2024-11-07 01:25:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:30,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533946001] [2024-11-07 01:25:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533946001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544068700] [2024-11-07 01:25:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:30,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:30,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:25:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:30,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 01:25:30,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:31,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:25:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544068700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:25:32,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:25:32,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-07 01:25:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603510394] [2024-11-07 01:25:32,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:25:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 01:25:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 01:25:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:25:32,964 INFO L87 Difference]: Start difference. First operand 8191 states and 10679 transitions. Second operand has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:33,652 INFO L93 Difference]: Finished difference Result 11773 states and 15190 transitions. [2024-11-07 01:25:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:25:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-07 01:25:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:33,661 INFO L225 Difference]: With dead ends: 11773 [2024-11-07 01:25:33,661 INFO L226 Difference]: Without dead ends: 8391 [2024-11-07 01:25:33,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 01:25:33,666 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 19336 mSDsluCounter, 10636 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19336 SdHoareTripleChecker+Valid, 12146 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:33,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19336 Valid, 12146 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:25:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2024-11-07 01:25:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 7065. [2024-11-07 01:25:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7063 states have (on average 1.3053943083675492) internal successors, (9220), 7064 states have internal predecessors, (9220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 9220 transitions. [2024-11-07 01:25:33,882 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 9220 transitions. Word has length 99 [2024-11-07 01:25:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:33,883 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 9220 transitions. [2024-11-07 01:25:33,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.962962962962963) internal successors, (215), 26 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 9220 transitions. [2024-11-07 01:25:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 01:25:33,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:33,885 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:33,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 01:25:34,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 01:25:34,088 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:34,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1960996049, now seen corresponding path program 1 times [2024-11-07 01:25:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684552262] [2024-11-07 01:25:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:34,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:34,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684552262] [2024-11-07 01:25:34,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684552262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:34,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210029321] [2024-11-07 01:25:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:34,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:34,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:34,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:34,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 01:25:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:34,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 01:25:34,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:35,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:25:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210029321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:25:36,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:25:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2024-11-07 01:25:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255332188] [2024-11-07 01:25:36,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:25:36,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 01:25:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 01:25:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-11-07 01:25:36,554 INFO L87 Difference]: Start difference. First operand 7065 states and 9220 transitions. Second operand has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:38,152 INFO L93 Difference]: Finished difference Result 10023 states and 12872 transitions. [2024-11-07 01:25:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 01:25:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-07 01:25:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:38,159 INFO L225 Difference]: With dead ends: 10023 [2024-11-07 01:25:38,159 INFO L226 Difference]: Without dead ends: 7151 [2024-11-07 01:25:38,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=669, Invalid=2411, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 01:25:38,165 INFO L432 NwaCegarLoop]: 1537 mSDtfsCounter, 17973 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17973 SdHoareTripleChecker+Valid, 13808 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:38,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17973 Valid, 13808 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:25:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2024-11-07 01:25:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7065. [2024-11-07 01:25:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7063 states have (on average 1.2993062438057483) internal successors, (9177), 7064 states have internal predecessors, (9177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 9177 transitions. [2024-11-07 01:25:38,613 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 9177 transitions. Word has length 99 [2024-11-07 01:25:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:38,613 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 9177 transitions. [2024-11-07 01:25:38,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.451612903225806) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 9177 transitions. [2024-11-07 01:25:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 01:25:38,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:38,615 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 01:25:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:38,819 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:38,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 852864303, now seen corresponding path program 1 times [2024-11-07 01:25:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900075639] [2024-11-07 01:25:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:39,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900075639] [2024-11-07 01:25:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900075639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747583647] [2024-11-07 01:25:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:39,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:39,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:39,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:39,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 01:25:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:39,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 01:25:39,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:40,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:25:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747583647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:25:41,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:25:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 40 [2024-11-07 01:25:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241210002] [2024-11-07 01:25:41,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:25:41,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-07 01:25:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-07 01:25:41,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1488, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 01:25:41,417 INFO L87 Difference]: Start difference. First operand 7065 states and 9177 transitions. Second operand has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:45,462 INFO L93 Difference]: Finished difference Result 12051 states and 15402 transitions. [2024-11-07 01:25:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-07 01:25:45,463 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-07 01:25:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:45,471 INFO L225 Difference]: With dead ends: 12051 [2024-11-07 01:25:45,471 INFO L226 Difference]: Without dead ends: 9795 [2024-11-07 01:25:45,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1910, Invalid=8596, Unknown=0, NotChecked=0, Total=10506 [2024-11-07 01:25:45,476 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 17487 mSDsluCounter, 26283 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17487 SdHoareTripleChecker+Valid, 27837 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:45,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17487 Valid, 27837 Invalid, 2198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:25:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2024-11-07 01:25:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 8169. [2024-11-07 01:25:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8167 states have (on average 1.2791722786825028) internal successors, (10447), 8168 states have internal predecessors, (10447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 10447 transitions. [2024-11-07 01:25:45,761 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 10447 transitions. Word has length 99 [2024-11-07 01:25:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:45,761 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 10447 transitions. [2024-11-07 01:25:45,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.902439024390244) internal successors, (283), 40 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 10447 transitions. [2024-11-07 01:25:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 01:25:45,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:45,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:45,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 01:25:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:45,968 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash -647619457, now seen corresponding path program 1 times [2024-11-07 01:25:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631456366] [2024-11-07 01:25:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631456366] [2024-11-07 01:25:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631456366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:46,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:25:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438707608] [2024-11-07 01:25:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:46,217 INFO L87 Difference]: Start difference. First operand 8169 states and 10447 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:49,906 INFO L93 Difference]: Finished difference Result 10424 states and 13842 transitions. [2024-11-07 01:25:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:25:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-07 01:25:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:49,919 INFO L225 Difference]: With dead ends: 10424 [2024-11-07 01:25:49,919 INFO L226 Difference]: Without dead ends: 8920 [2024-11-07 01:25:49,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:25:49,924 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 961 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 4582 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 4803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 4582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:49,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1308 Invalid, 4803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 4582 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 01:25:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2024-11-07 01:25:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8920. [2024-11-07 01:25:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8920 states, 8918 states have (on average 1.2563355012334605) internal successors, (11204), 8919 states have internal predecessors, (11204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 11204 transitions. [2024-11-07 01:25:50,386 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 11204 transitions. Word has length 99 [2024-11-07 01:25:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 8920 states and 11204 transitions. [2024-11-07 01:25:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 11204 transitions. [2024-11-07 01:25:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 01:25:50,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:50,390 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:25:50,393 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -99841195, now seen corresponding path program 1 times [2024-11-07 01:25:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717334651] [2024-11-07 01:25:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717334651] [2024-11-07 01:25:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717334651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:25:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473863169] [2024-11-07 01:25:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:51,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:25:51,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:51,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:25:51,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 01:25:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:51,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 01:25:51,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:25:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 01:25:54,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473863169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:02,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:02,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 29] total 71 [2024-11-07 01:26:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634881589] [2024-11-07 01:26:02,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:02,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-07 01:26:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-07 01:26:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=4484, Unknown=0, NotChecked=0, Total=4970 [2024-11-07 01:26:02,809 INFO L87 Difference]: Start difference. First operand 8920 states and 11204 transitions. Second operand has 71 states, 71 states have (on average 3.788732394366197) internal successors, (269), 71 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)