./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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', '8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3'] 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/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:30:21,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:30:22,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:30:22,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:30:22,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:30:22,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:30:22,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:30:22,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:30:22,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:30:22,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:30:22,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:30:22,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:30:22,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:30:22,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:30:22,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:30:22,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:30:22,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:30:22,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:30:22,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:30:22,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:30:22,120 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 -> 8080e0a725fc4bb7ff7c553cf5cace8f3ab82ec5bf4c36129edf77f076dbcbd3 [2024-11-07 00:30:22,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:30:22,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:30:22,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:30:22,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:30:22,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:30:22,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:30:23,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:30:24,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:30:24,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:30:24,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2fe24611/d048998c2eb7454b8abc55a6ed5b033a/FLAG39d3b7df9 [2024-11-07 00:30:24,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2fe24611/d048998c2eb7454b8abc55a6ed5b033a [2024-11-07 00:30:24,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:30:24,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:30:24,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:30:24,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:30:24,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:30:24,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c86eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24, skipping insertion in model container [2024-11-07 00:30:24,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:30:24,698 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/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-11-07 00:30:24,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:30:24,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:30:24,777 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/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4940,4953] [2024-11-07 00:30:24,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:30:24,808 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:30:24,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24 WrapperNode [2024-11-07 00:30:24,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:30:24,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:30:24,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:30:24,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:30:24,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,869 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 370 [2024-11-07 00:30:24,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:30:24,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:30:24,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:30:24,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:30:24,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,910 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 00:30:24,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:30:24,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:30:24,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:30:24,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:30:24,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (1/1) ... [2024-11-07 00:30:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:30:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:24,985 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 00:30:24,990 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 00:30:25,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:30:25,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:30:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:30:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:30:25,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:30:25,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:30:25,568 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-07 00:30:25,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:30:25,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:30:25,585 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:30:25,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:25 BoogieIcfgContainer [2024-11-07 00:30:25,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:30:25,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:30:25,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:30:25,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:30:25,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:30:24" (1/3) ... [2024-11-07 00:30:25,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70708770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:25, skipping insertion in model container [2024-11-07 00:30:25,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:24" (2/3) ... [2024-11-07 00:30:25,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70708770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:25, skipping insertion in model container [2024-11-07 00:30:25,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:25" (3/3) ... [2024-11-07 00:30:25,596 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-07 00:30:25,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:30:25,611 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:30:25,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:30:25,683 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;@175a2495, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:30:25,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:30:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 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 00:30:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:30:25,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:25,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:25,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash 377049112, now seen corresponding path program 1 times [2024-11-07 00:30:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:25,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771477899] [2024-11-07 00:30:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:26,138 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 00:30:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771477899] [2024-11-07 00:30:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771477899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:26,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533042824] [2024-11-07 00:30:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:26,170 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 80 states have internal predecessors, (135), 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 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 00:30:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:26,222 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2024-11-07 00:30:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2024-11-07 00:30:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:26,230 INFO L225 Difference]: With dead ends: 183 [2024-11-07 00:30:26,231 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 00:30:26,233 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 00:30:26,236 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:26,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 00:30:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-07 00:30:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 119 states have internal predecessors, (175), 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 00:30:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2024-11-07 00:30:26,298 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 48 [2024-11-07 00:30:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:26,298 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2024-11-07 00:30:26,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 00:30:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2024-11-07 00:30:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 00:30:26,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:26,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:26,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:30:26,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash 292717965, now seen corresponding path program 1 times [2024-11-07 00:30:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453805813] [2024-11-07 00:30:26,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:26,472 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 00:30:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453805813] [2024-11-07 00:30:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453805813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532044086] [2024-11-07 00:30:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:26,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:26,477 INFO L87 Difference]: Start difference. First operand 120 states and 175 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 00:30:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:26,504 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2024-11-07 00:30:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 49 [2024-11-07 00:30:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:26,507 INFO L225 Difference]: With dead ends: 292 [2024-11-07 00:30:26,507 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 00:30:26,507 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 00:30:26,508 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:26,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 00:30:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-11-07 00:30:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 195 states have internal predecessors, (295), 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 00:30:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 295 transitions. [2024-11-07 00:30:26,522 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 295 transitions. Word has length 49 [2024-11-07 00:30:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:26,523 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 295 transitions. [2024-11-07 00:30:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 00:30:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 295 transitions. [2024-11-07 00:30:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:30:26,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:26,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:26,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:30:26,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:26,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash -875864605, now seen corresponding path program 1 times [2024-11-07 00:30:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83264260] [2024-11-07 00:30:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:26,667 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 00:30:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:26,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83264260] [2024-11-07 00:30:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83264260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:26,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:26,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573591013] [2024-11-07 00:30:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:26,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:26,671 INFO L87 Difference]: Start difference. First operand 196 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 00:30:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:26,705 INFO L93 Difference]: Finished difference Result 504 states and 781 transitions. [2024-11-07 00:30:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2024-11-07 00:30:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:26,708 INFO L225 Difference]: With dead ends: 504 [2024-11-07 00:30:26,708 INFO L226 Difference]: Without dead ends: 334 [2024-11-07 00:30:26,712 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 00:30:26,713 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:26,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-07 00:30:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2024-11-07 00:30:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 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 00:30:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2024-11-07 00:30:26,777 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 50 [2024-11-07 00:30:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:26,779 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2024-11-07 00:30:26,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 00:30:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2024-11-07 00:30:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:30:26,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:26,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:30:26,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1524907140, now seen corresponding path program 1 times [2024-11-07 00:30:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128314170] [2024-11-07 00:30:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:27,004 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 00:30:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128314170] [2024-11-07 00:30:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128314170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406393411] [2024-11-07 00:30:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:27,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:27,008 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 00:30:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:27,237 INFO L93 Difference]: Finished difference Result 2780 states and 4355 transitions. [2024-11-07 00:30:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:30:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 51 [2024-11-07 00:30:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:27,251 INFO L225 Difference]: With dead ends: 2780 [2024-11-07 00:30:27,252 INFO L226 Difference]: Without dead ends: 2474 [2024-11-07 00:30:27,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:30:27,258 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 697 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:27,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1115 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2024-11-07 00:30:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 636. [2024-11-07 00:30:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5291338582677165) internal successors, (971), 635 states have internal predecessors, (971), 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 00:30:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 971 transitions. [2024-11-07 00:30:27,344 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 971 transitions. Word has length 51 [2024-11-07 00:30:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 971 transitions. [2024-11-07 00:30:27,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 00:30:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 971 transitions. [2024-11-07 00:30:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:30:27,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:27,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:30:27,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash -48905761, now seen corresponding path program 1 times [2024-11-07 00:30:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653776781] [2024-11-07 00:30:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:27,699 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 00:30:27,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653776781] [2024-11-07 00:30:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653776781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417567127] [2024-11-07 00:30:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:27,701 INFO L87 Difference]: Start difference. First operand 636 states and 971 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 00:30:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:27,835 INFO L93 Difference]: Finished difference Result 1248 states and 1917 transitions. [2024-11-07 00:30:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:30:27,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 53 [2024-11-07 00:30:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:27,840 INFO L225 Difference]: With dead ends: 1248 [2024-11-07 00:30:27,840 INFO L226 Difference]: Without dead ends: 638 [2024-11-07 00:30:27,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:30:27,842 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 168 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:27,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 336 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-07 00:30:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2024-11-07 00:30:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5165354330708662) internal successors, (963), 635 states have internal predecessors, (963), 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 00:30:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 963 transitions. [2024-11-07 00:30:27,867 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 963 transitions. Word has length 53 [2024-11-07 00:30:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:27,868 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 963 transitions. [2024-11-07 00:30:27,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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 00:30:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 963 transitions. [2024-11-07 00:30:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:30:27,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:27,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:27,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:30:27,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:27,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -69908416, now seen corresponding path program 1 times [2024-11-07 00:30:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:27,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641676248] [2024-11-07 00:30:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:28,025 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 00:30:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641676248] [2024-11-07 00:30:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641676248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124884489] [2024-11-07 00:30:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:28,027 INFO L87 Difference]: Start difference. First operand 636 states and 963 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 00:30:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:28,064 INFO L93 Difference]: Finished difference Result 1768 states and 2685 transitions. [2024-11-07 00:30:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 53 [2024-11-07 00:30:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:28,071 INFO L225 Difference]: With dead ends: 1768 [2024-11-07 00:30:28,072 INFO L226 Difference]: Without dead ends: 1158 [2024-11-07 00:30:28,073 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 00:30:28,076 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:28,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 181 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-07 00:30:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1140. [2024-11-07 00:30:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4846356453028973) internal successors, (1691), 1139 states have internal predecessors, (1691), 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 00:30:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1691 transitions. [2024-11-07 00:30:28,121 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1691 transitions. Word has length 53 [2024-11-07 00:30:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:28,122 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1691 transitions. [2024-11-07 00:30:28,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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 00:30:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1691 transitions. [2024-11-07 00:30:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:30:28,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:28,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:30:28,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1517987980, now seen corresponding path program 1 times [2024-11-07 00:30:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224998784] [2024-11-07 00:30:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:28,294 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 00:30:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:28,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224998784] [2024-11-07 00:30:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224998784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607071524] [2024-11-07 00:30:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:28,299 INFO L87 Difference]: Start difference. First operand 1140 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:28,384 INFO L93 Difference]: Finished difference Result 2254 states and 3356 transitions. [2024-11-07 00:30:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:28,390 INFO L225 Difference]: With dead ends: 2254 [2024-11-07 00:30:28,390 INFO L226 Difference]: Without dead ends: 1140 [2024-11-07 00:30:28,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:28,396 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 245 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:28,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-07 00:30:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2024-11-07 00:30:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4705882352941178) internal successors, (1675), 1139 states have internal predecessors, (1675), 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 00:30:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1675 transitions. [2024-11-07 00:30:28,428 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1675 transitions. Word has length 54 [2024-11-07 00:30:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1675 transitions. [2024-11-07 00:30:28,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1675 transitions. [2024-11-07 00:30:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:30:28,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:28,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:30:28,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:28,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2047278481, now seen corresponding path program 1 times [2024-11-07 00:30:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563826924] [2024-11-07 00:30:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:28,549 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 00:30:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563826924] [2024-11-07 00:30:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563826924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751349643] [2024-11-07 00:30:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:28,551 INFO L87 Difference]: Start difference. First operand 1140 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:28,629 INFO L93 Difference]: Finished difference Result 2254 states and 3324 transitions. [2024-11-07 00:30:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:28,634 INFO L225 Difference]: With dead ends: 2254 [2024-11-07 00:30:28,634 INFO L226 Difference]: Without dead ends: 1140 [2024-11-07 00:30:28,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:28,637 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 268 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:28,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 78 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-07 00:30:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2024-11-07 00:30:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.456540825285338) internal successors, (1659), 1139 states have internal predecessors, (1659), 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 00:30:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1659 transitions. [2024-11-07 00:30:28,667 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1659 transitions. Word has length 54 [2024-11-07 00:30:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:28,667 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1659 transitions. [2024-11-07 00:30:28,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1659 transitions. [2024-11-07 00:30:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:30:28,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:28,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:30:28,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:28,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1919193174, now seen corresponding path program 1 times [2024-11-07 00:30:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498707525] [2024-11-07 00:30:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:28,765 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 00:30:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498707525] [2024-11-07 00:30:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498707525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:28,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918103055] [2024-11-07 00:30:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:28,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:28,767 INFO L87 Difference]: Start difference. First operand 1140 states and 1659 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:28,845 INFO L93 Difference]: Finished difference Result 2254 states and 3292 transitions. [2024-11-07 00:30:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:28,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:28,853 INFO L225 Difference]: With dead ends: 2254 [2024-11-07 00:30:28,853 INFO L226 Difference]: Without dead ends: 1140 [2024-11-07 00:30:28,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:28,857 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 252 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:28,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 86 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-07 00:30:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2024-11-07 00:30:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4424934152765583) internal successors, (1643), 1139 states have internal predecessors, (1643), 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 00:30:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1643 transitions. [2024-11-07 00:30:28,891 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1643 transitions. Word has length 54 [2024-11-07 00:30:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:28,891 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1643 transitions. [2024-11-07 00:30:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 00:30:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1643 transitions. [2024-11-07 00:30:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:30:28,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:28,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:30:28,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1053660785, now seen corresponding path program 1 times [2024-11-07 00:30:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929445890] [2024-11-07 00:30:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:29,131 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 00:30:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929445890] [2024-11-07 00:30:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929445890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:30:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826591539] [2024-11-07 00:30:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:29,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:29,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:29,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:29,133 INFO L87 Difference]: Start difference. First operand 1140 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 00:30:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:29,162 INFO L93 Difference]: Finished difference Result 1174 states and 1692 transitions. [2024-11-07 00:30:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:29,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 00:30:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:29,167 INFO L225 Difference]: With dead ends: 1174 [2024-11-07 00:30:29,167 INFO L226 Difference]: Without dead ends: 1172 [2024-11-07 00:30:29,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 00:30:29,168 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:29,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-07 00:30:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2024-11-07 00:30:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.4235695986336465) internal successors, (1667), 1171 states have internal predecessors, (1667), 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 00:30:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1667 transitions. [2024-11-07 00:30:29,197 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1667 transitions. Word has length 54 [2024-11-07 00:30:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:29,197 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1667 transitions. [2024-11-07 00:30:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 00:30:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1667 transitions. [2024-11-07 00:30:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:30:29,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:29,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:30:29,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1226019551, now seen corresponding path program 1 times [2024-11-07 00:30:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458378087] [2024-11-07 00:30:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:29,248 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 00:30:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458378087] [2024-11-07 00:30:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458378087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645962392] [2024-11-07 00:30:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:29,250 INFO L87 Difference]: Start difference. First operand 1172 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 00:30:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:29,276 INFO L93 Difference]: Finished difference Result 2299 states and 3305 transitions. [2024-11-07 00:30:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 00:30:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:29,283 INFO L225 Difference]: With dead ends: 2299 [2024-11-07 00:30:29,283 INFO L226 Difference]: Without dead ends: 1656 [2024-11-07 00:30:29,285 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 00:30:29,286 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 66 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:29,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-07 00:30:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1654. [2024-11-07 00:30:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4162129461584998) internal successors, (2341), 1653 states have internal predecessors, (2341), 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 00:30:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2341 transitions. [2024-11-07 00:30:29,323 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2341 transitions. Word has length 54 [2024-11-07 00:30:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:29,323 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2341 transitions. [2024-11-07 00:30:29,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 00:30:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2341 transitions. [2024-11-07 00:30:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:30:29,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:29,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:29,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:30:29,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 595199301, now seen corresponding path program 1 times [2024-11-07 00:30:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642929231] [2024-11-07 00:30:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:30:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642929231] [2024-11-07 00:30:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642929231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:29,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:29,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451436639] [2024-11-07 00:30:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:29,490 INFO L87 Difference]: Start difference. First operand 1654 states and 2341 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 00:30:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:29,624 INFO L93 Difference]: Finished difference Result 8472 states and 12022 transitions. [2024-11-07 00:30:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:30:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 77 [2024-11-07 00:30:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:29,650 INFO L225 Difference]: With dead ends: 8472 [2024-11-07 00:30:29,651 INFO L226 Difference]: Without dead ends: 6846 [2024-11-07 00:30:29,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:29,656 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 489 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:29,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 548 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6846 states. [2024-11-07 00:30:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6846 to 3278. [2024-11-07 00:30:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3277 states have (on average 1.4125724748245347) internal successors, (4629), 3277 states have internal predecessors, (4629), 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 00:30:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4629 transitions. [2024-11-07 00:30:29,784 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4629 transitions. Word has length 77 [2024-11-07 00:30:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:29,785 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 4629 transitions. [2024-11-07 00:30:29,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 00:30:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4629 transitions. [2024-11-07 00:30:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:30:29,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:29,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:30:29,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:29,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -558746805, now seen corresponding path program 1 times [2024-11-07 00:30:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790633887] [2024-11-07 00:30:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:30:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790633887] [2024-11-07 00:30:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790633887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995291779] [2024-11-07 00:30:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:29,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:29,937 INFO L87 Difference]: Start difference. First operand 3278 states and 4629 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 00:30:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:30,079 INFO L93 Difference]: Finished difference Result 10096 states and 14310 transitions. [2024-11-07 00:30:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:30:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 77 [2024-11-07 00:30:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:30,108 INFO L225 Difference]: With dead ends: 10096 [2024-11-07 00:30:30,108 INFO L226 Difference]: Without dead ends: 8470 [2024-11-07 00:30:30,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:30,115 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 476 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:30,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 563 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2024-11-07 00:30:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 5718. [2024-11-07 00:30:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4065069092181215) internal successors, (8041), 5717 states have internal predecessors, (8041), 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 00:30:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8041 transitions. [2024-11-07 00:30:30,276 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8041 transitions. Word has length 77 [2024-11-07 00:30:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:30,276 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8041 transitions. [2024-11-07 00:30:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 00:30:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8041 transitions. [2024-11-07 00:30:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:30:30,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:30,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:30,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:30:30,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -262701377, now seen corresponding path program 1 times [2024-11-07 00:30:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657189735] [2024-11-07 00:30:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 00:30:30,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657189735] [2024-11-07 00:30:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657189735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:30,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091406774] [2024-11-07 00:30:30,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:30,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:30,426 INFO L87 Difference]: Start difference. First operand 5718 states and 8041 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 00:30:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:30,563 INFO L93 Difference]: Finished difference Result 11720 states and 16598 transitions. [2024-11-07 00:30:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:30:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 77 [2024-11-07 00:30:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:30,590 INFO L225 Difference]: With dead ends: 11720 [2024-11-07 00:30:30,590 INFO L226 Difference]: Without dead ends: 10094 [2024-11-07 00:30:30,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:30,598 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 441 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:30,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 645 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2024-11-07 00:30:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 7342. [2024-11-07 00:30:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7342 states, 7341 states have (on average 1.4070290151205558) internal successors, (10329), 7341 states have internal predecessors, (10329), 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 00:30:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 10329 transitions. [2024-11-07 00:30:30,788 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 10329 transitions. Word has length 77 [2024-11-07 00:30:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 7342 states and 10329 transitions. [2024-11-07 00:30:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 00:30:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 10329 transitions. [2024-11-07 00:30:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:30:30,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:30,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:30:30,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:30,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2055185859, now seen corresponding path program 1 times [2024-11-07 00:30:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542677895] [2024-11-07 00:30:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:30:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542677895] [2024-11-07 00:30:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542677895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:30:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879370276] [2024-11-07 00:30:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:30:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:30:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:30:30,944 INFO L87 Difference]: Start difference. First operand 7342 states and 10329 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 00:30:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:31,084 INFO L93 Difference]: Finished difference Result 12336 states and 17494 transitions. [2024-11-07 00:30:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:30:31,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 78 [2024-11-07 00:30:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:31,113 INFO L225 Difference]: With dead ends: 12336 [2024-11-07 00:30:31,114 INFO L226 Difference]: Without dead ends: 11214 [2024-11-07 00:30:31,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:31,122 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 432 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:31,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 602 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2024-11-07 00:30:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 8462. [2024-11-07 00:30:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8462 states, 8461 states have (on average 1.4098806287672851) internal successors, (11929), 8461 states have internal predecessors, (11929), 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 00:30:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 11929 transitions. [2024-11-07 00:30:31,315 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 11929 transitions. Word has length 78 [2024-11-07 00:30:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:31,315 INFO L471 AbstractCegarLoop]: Abstraction has 8462 states and 11929 transitions. [2024-11-07 00:30:31,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 00:30:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 11929 transitions. [2024-11-07 00:30:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:30:31,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:31,319 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:30:31,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:30:31,319 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -144941472, now seen corresponding path program 1 times [2024-11-07 00:30:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004403984] [2024-11-07 00:30:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004403984] [2024-11-07 00:30:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004403984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460362970] [2024-11-07 00:30:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:31,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:31,414 INFO L87 Difference]: Start difference. First operand 8462 states and 11929 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 00:30:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:31,488 INFO L93 Difference]: Finished difference Result 14658 states and 20769 transitions. [2024-11-07 00:30:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-07 00:30:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:31,503 INFO L225 Difference]: With dead ends: 14658 [2024-11-07 00:30:31,504 INFO L226 Difference]: Without dead ends: 6224 [2024-11-07 00:30:31,514 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 00:30:31,515 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 48 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:31,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2024-11-07 00:30:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6222. [2024-11-07 00:30:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 1.4110271660504743) internal successors, (8778), 6221 states have internal predecessors, (8778), 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 00:30:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 8778 transitions. [2024-11-07 00:30:31,604 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 8778 transitions. Word has length 79 [2024-11-07 00:30:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:31,604 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 8778 transitions. [2024-11-07 00:30:31,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 00:30:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 8778 transitions. [2024-11-07 00:30:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:30:31,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:31,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:31,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:30:31,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:31,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1559581035, now seen corresponding path program 1 times [2024-11-07 00:30:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115163109] [2024-11-07 00:30:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115163109] [2024-11-07 00:30:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115163109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976349408] [2024-11-07 00:30:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:32,013 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 00:30:32,014 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 00:30:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:32,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:30:32,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:32,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976349408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:33,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-07 00:30:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580470119] [2024-11-07 00:30:33,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 00:30:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 00:30:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:30:33,780 INFO L87 Difference]: Start difference. First operand 6222 states and 8778 transitions. Second operand has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 20 states have internal predecessors, (181), 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 00:30:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:34,504 INFO L93 Difference]: Finished difference Result 21419 states and 30132 transitions. [2024-11-07 00:30:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:30:34,504 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 20 states have internal predecessors, (181), 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 79 [2024-11-07 00:30:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:34,539 INFO L225 Difference]: With dead ends: 21419 [2024-11-07 00:30:34,540 INFO L226 Difference]: Without dead ends: 15257 [2024-11-07 00:30:34,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:30:34,555 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1213 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:34,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 640 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:30:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15257 states. [2024-11-07 00:30:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15257 to 13097. [2024-11-07 00:30:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13097 states, 13096 states have (on average 1.4069181429444104) internal successors, (18425), 13096 states have internal predecessors, (18425), 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 00:30:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13097 states to 13097 states and 18425 transitions. [2024-11-07 00:30:34,756 INFO L78 Accepts]: Start accepts. Automaton has 13097 states and 18425 transitions. Word has length 79 [2024-11-07 00:30:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:34,757 INFO L471 AbstractCegarLoop]: Abstraction has 13097 states and 18425 transitions. [2024-11-07 00:30:34,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 20 states have internal predecessors, (181), 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 00:30:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13097 states and 18425 transitions. [2024-11-07 00:30:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:30:34,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:34,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:34,781 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 00:30:34,961 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 00:30:34,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:34,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1183040057, now seen corresponding path program 1 times [2024-11-07 00:30:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435710542] [2024-11-07 00:30:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435710542] [2024-11-07 00:30:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435710542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960868431] [2024-11-07 00:30:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:35,503 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 00:30:35,505 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 00:30:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:35,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 00:30:35,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:36,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960868431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:36,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2024-11-07 00:30:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477615217] [2024-11-07 00:30:36,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 00:30:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 00:30:36,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:30:36,880 INFO L87 Difference]: Start difference. First operand 13097 states and 18425 transitions. Second operand has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 29 states have internal predecessors, (218), 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 00:30:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:41,552 INFO L93 Difference]: Finished difference Result 115809 states and 160582 transitions. [2024-11-07 00:30:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-07 00:30:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 29 states have internal predecessors, (218), 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 80 [2024-11-07 00:30:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:41,842 INFO L225 Difference]: With dead ends: 115809 [2024-11-07 00:30:41,843 INFO L226 Difference]: Without dead ends: 102742 [2024-11-07 00:30:41,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4114 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2403, Invalid=10937, Unknown=0, NotChecked=0, Total=13340 [2024-11-07 00:30:41,896 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 2965 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 3360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 3389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:41,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 1707 Invalid, 3389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3360 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:30:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102742 states. [2024-11-07 00:30:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102742 to 66119. [2024-11-07 00:30:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66119 states, 66118 states have (on average 1.3924196134184337) internal successors, (92064), 66118 states have internal predecessors, (92064), 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 00:30:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66119 states to 66119 states and 92064 transitions. [2024-11-07 00:30:43,267 INFO L78 Accepts]: Start accepts. Automaton has 66119 states and 92064 transitions. Word has length 80 [2024-11-07 00:30:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:43,267 INFO L471 AbstractCegarLoop]: Abstraction has 66119 states and 92064 transitions. [2024-11-07 00:30:43,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 29 states have internal predecessors, (218), 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 00:30:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 66119 states and 92064 transitions. [2024-11-07 00:30:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:30:43,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:43,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:43,290 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 00:30:43,475 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 00:30:43,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2040940735, now seen corresponding path program 1 times [2024-11-07 00:30:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761924563] [2024-11-07 00:30:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761924563] [2024-11-07 00:30:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761924563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818538610] [2024-11-07 00:30:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:44,013 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 00:30:44,015 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 00:30:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:44,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 00:30:44,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:44,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818538610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:45,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-07 00:30:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380534437] [2024-11-07 00:30:45,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:45,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 00:30:45,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 00:30:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:30:45,772 INFO L87 Difference]: Start difference. First operand 66119 states and 92064 transitions. Second operand has 25 states, 25 states have (on average 9.08) internal successors, (227), 24 states have internal predecessors, (227), 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 00:30:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:50,652 INFO L93 Difference]: Finished difference Result 358449 states and 495789 transitions. [2024-11-07 00:30:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-11-07 00:30:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.08) internal successors, (227), 24 states have internal predecessors, (227), 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 80 [2024-11-07 00:30:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:51,571 INFO L225 Difference]: With dead ends: 358449 [2024-11-07 00:30:51,572 INFO L226 Difference]: Without dead ends: 292469 [2024-11-07 00:30:51,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7046 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3278, Invalid=17028, Unknown=0, NotChecked=0, Total=20306 [2024-11-07 00:30:51,801 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3991 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3991 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:51,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3991 Valid, 1167 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:30:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292469 states. [2024-11-07 00:30:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292469 to 179835. [2024-11-07 00:30:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179835 states, 179834 states have (on average 1.3815852397210762) internal successors, (248456), 179834 states have internal predecessors, (248456), 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 00:30:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179835 states to 179835 states and 248456 transitions. [2024-11-07 00:30:55,889 INFO L78 Accepts]: Start accepts. Automaton has 179835 states and 248456 transitions. Word has length 80 [2024-11-07 00:30:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:55,890 INFO L471 AbstractCegarLoop]: Abstraction has 179835 states and 248456 transitions. [2024-11-07 00:30:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.08) internal successors, (227), 24 states have internal predecessors, (227), 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 00:30:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 179835 states and 248456 transitions. [2024-11-07 00:30:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:30:55,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:55,900 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, 1, 1, 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 00:30:55,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 00:30:56,101 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 00:30:56,101 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:56,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1263877048, now seen corresponding path program 1 times [2024-11-07 00:30:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960647865] [2024-11-07 00:30:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:56,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960647865] [2024-11-07 00:30:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960647865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:56,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151419526] [2024-11-07 00:30:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:56,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:56,221 INFO L87 Difference]: Start difference. First operand 179835 states and 248456 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:30:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:57,405 INFO L93 Difference]: Finished difference Result 270589 states and 374045 transitions. [2024-11-07 00:30:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2024-11-07 00:30:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:57,559 INFO L225 Difference]: With dead ends: 270589 [2024-11-07 00:30:57,559 INFO L226 Difference]: Without dead ends: 91045 [2024-11-07 00:30:57,650 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 00:30:57,651 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:57,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 210 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91045 states. [2024-11-07 00:30:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91045 to 89723. [2024-11-07 00:30:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89723 states, 89722 states have (on average 1.3663761396313057) internal successors, (122594), 89722 states have internal predecessors, (122594), 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 00:30:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89723 states to 89723 states and 122594 transitions. [2024-11-07 00:30:58,859 INFO L78 Accepts]: Start accepts. Automaton has 89723 states and 122594 transitions. Word has length 82 [2024-11-07 00:30:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:58,859 INFO L471 AbstractCegarLoop]: Abstraction has 89723 states and 122594 transitions. [2024-11-07 00:30:58,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:30:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 89723 states and 122594 transitions. [2024-11-07 00:30:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:30:58,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:58,864 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, 1, 1, 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 00:30:58,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:30:58,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1549617493, now seen corresponding path program 1 times [2024-11-07 00:30:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238425433] [2024-11-07 00:30:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238425433] [2024-11-07 00:30:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238425433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667531524] [2024-11-07 00:30:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:58,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:58,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:58,949 INFO L87 Difference]: Start difference. First operand 89723 states and 122594 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:30:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:59,763 INFO L93 Difference]: Finished difference Result 143363 states and 195383 transitions. [2024-11-07 00:30:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:59,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2024-11-07 00:30:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:59,876 INFO L225 Difference]: With dead ends: 143363 [2024-11-07 00:30:59,876 INFO L226 Difference]: Without dead ends: 53931 [2024-11-07 00:30:59,943 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 00:30:59,944 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 32 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:59,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53931 states. [2024-11-07 00:31:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53931 to 53929. [2024-11-07 00:31:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53929 states, 53928 states have (on average 1.342345349354695) internal successors, (72390), 53928 states have internal predecessors, (72390), 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 00:31:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53929 states to 53929 states and 72390 transitions. [2024-11-07 00:31:00,983 INFO L78 Accepts]: Start accepts. Automaton has 53929 states and 72390 transitions. Word has length 82 [2024-11-07 00:31:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 53929 states and 72390 transitions. [2024-11-07 00:31:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 00:31:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53929 states and 72390 transitions. [2024-11-07 00:31:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:31:00,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:00,986 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, 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 00:31:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:31:00,987 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:31:00,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1110890325, now seen corresponding path program 1 times [2024-11-07 00:31:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029860885] [2024-11-07 00:31:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029860885] [2024-11-07 00:31:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029860885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:31:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776494407] [2024-11-07 00:31:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:01,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:31:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:31:01,572 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 00:31:01,573 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 00:31:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:01,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-07 00:31:01,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:31:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:06,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:31:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776494407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:31:10,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:31:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 30] total 71 [2024-11-07 00:31:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894170053] [2024-11-07 00:31:10,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:31:10,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-07 00:31:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-07 00:31:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=4480, Unknown=0, NotChecked=0, Total=4970 [2024-11-07 00:31:10,543 INFO L87 Difference]: Start difference. First operand 53929 states and 72390 transitions. Second operand has 71 states, 71 states have (on average 3.1971830985915495) internal successors, (227), 71 states have internal predecessors, (227), 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)