./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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', 'e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca'] 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.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 e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:06:27,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:06:27,577 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:06:27,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:06:27,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:06:27,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:06:27,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:06:27,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:06:27,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:06:27,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:06:27,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:06:27,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:06:27,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:06:27,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:06:27,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:06:27,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:06:27,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:06:27,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:06:27,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:06:27,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:06:27,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:06:27,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:06:27,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:06:27,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:06:27,610 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2024-11-07 00:06:27,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:06:27,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:06:27,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:06:27,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:06:27,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:06:27,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-11-07 00:06:29,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:06:30,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:06:30,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-11-07 00:06:30,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33bef7177/5b9a95f0c9684790a7b680619442a172/FLAGb9d7957ed [2024-11-07 00:06:30,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33bef7177/5b9a95f0c9684790a7b680619442a172 [2024-11-07 00:06:30,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:06:30,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:06:30,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:06:30,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:06:30,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:06:30,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb5c1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30, skipping insertion in model container [2024-11-07 00:06:30,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:06:30,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2024-11-07 00:06:30,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:06:30,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:06:30,547 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2024-11-07 00:06:30,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:06:30,570 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:06:30,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30 WrapperNode [2024-11-07 00:06:30,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:06:30,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:06:30,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:06:30,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:06:30,580 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:06:30" (1/1) ... [2024-11-07 00:06:30,588 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:06:30" (1/1) ... [2024-11-07 00:06:30,617 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2024-11-07 00:06:30,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:06:30,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:06:30,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:06:30,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:06:30,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,662 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:06:30,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:06:30,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:06:30,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:06:30,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:06:30,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (1/1) ... [2024-11-07 00:06:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:06:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:30,747 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:06:30,759 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:06:30,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:06:30,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:06:30,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:06:30,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:06:30,868 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:06:30,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:06:31,110 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-07 00:06:31,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:06:31,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:06:31,119 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:06:31,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:06:31 BoogieIcfgContainer [2024-11-07 00:06:31,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:06:31,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:06:31,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:06:31,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:06:31,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:06:30" (1/3) ... [2024-11-07 00:06:31,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:06:31, skipping insertion in model container [2024-11-07 00:06:31,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:06:30" (2/3) ... [2024-11-07 00:06:31,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11af6251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:06:31, skipping insertion in model container [2024-11-07 00:06:31,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:06:31" (3/3) ... [2024-11-07 00:06:31,130 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2024-11-07 00:06:31,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:06:31,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:06:31,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:06:31,198 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;@2443621c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:06:31,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:06:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 55 states have internal predecessors, (92), 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:06:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 00:06:31,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:31,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:31,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:31,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 904518825, now seen corresponding path program 1 times [2024-11-07 00:06:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146697688] [2024-11-07 00:06:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:31,374 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:06:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146697688] [2024-11-07 00:06:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146697688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:06:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282555133] [2024-11-07 00:06:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:31,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:06:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:31,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:06:31,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:06:31,398 INFO L87 Difference]: Start difference. First operand has 56 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 55 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:06:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:31,445 INFO L93 Difference]: Finished difference Result 87 states and 143 transitions. [2024-11-07 00:06:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:06:31,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-11-07 00:06:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:31,455 INFO L225 Difference]: With dead ends: 87 [2024-11-07 00:06:31,456 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 00:06:31,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:06:31,463 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:31,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 00:06:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 00:06:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 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:06:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2024-11-07 00:06:31,502 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 19 [2024-11-07 00:06:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:31,503 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2024-11-07 00:06:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:06:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2024-11-07 00:06:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 00:06:31,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:31,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:31,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:06:31,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:31,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -106598425, now seen corresponding path program 1 times [2024-11-07 00:06:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526912255] [2024-11-07 00:06:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:31,779 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:06:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526912255] [2024-11-07 00:06:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526912255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415263180] [2024-11-07 00:06:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:31,782 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:06:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:31,841 INFO L93 Difference]: Finished difference Result 86 states and 136 transitions. [2024-11-07 00:06:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:06:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-07 00:06:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:31,843 INFO L225 Difference]: With dead ends: 86 [2024-11-07 00:06:31,843 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 00:06:31,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:31,844 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:31,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 00:06:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 00:06:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 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:06:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-11-07 00:06:31,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 19 [2024-11-07 00:06:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:31,849 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-11-07 00:06:31,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:06:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2024-11-07 00:06:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 00:06:31,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:31,852 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] [2024-11-07 00:06:31,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:06:31,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1681437636, now seen corresponding path program 1 times [2024-11-07 00:06:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21426903] [2024-11-07 00:06:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:32,132 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:06:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21426903] [2024-11-07 00:06:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21426903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:32,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048176752] [2024-11-07 00:06:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:32,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:32,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:32,135 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:06:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:32,355 INFO L93 Difference]: Finished difference Result 232 states and 351 transitions. [2024-11-07 00:06:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:06:32,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-11-07 00:06:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:32,360 INFO L225 Difference]: With dead ends: 232 [2024-11-07 00:06:32,360 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 00:06:32,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:06:32,361 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 272 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:32,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 426 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:06:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 00:06:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 80. [2024-11-07 00:06:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 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:06:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-07 00:06:32,422 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 34 [2024-11-07 00:06:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:32,423 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-07 00:06:32,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:06:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-07 00:06:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 00:06:32,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:32,424 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] [2024-11-07 00:06:32,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:06:32,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -461836524, now seen corresponding path program 1 times [2024-11-07 00:06:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906129748] [2024-11-07 00:06:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:32,520 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:06:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906129748] [2024-11-07 00:06:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906129748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091703392] [2024-11-07 00:06:32,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:32,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:32,523 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:06:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:32,542 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2024-11-07 00:06:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-07 00:06:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:32,543 INFO L225 Difference]: With dead ends: 185 [2024-11-07 00:06:32,543 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 00:06:32,544 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:06:32,544 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 00:06:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-07 00:06:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 124 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:06:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-11-07 00:06:32,553 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 36 [2024-11-07 00:06:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:32,554 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-11-07 00:06:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:06:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-11-07 00:06:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 00:06:32,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:32,555 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] [2024-11-07 00:06:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:06:32,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:32,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -395343012, now seen corresponding path program 1 times [2024-11-07 00:06:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242135092] [2024-11-07 00:06:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:32,735 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:06:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242135092] [2024-11-07 00:06:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242135092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651177528] [2024-11-07 00:06:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:32,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:32,737 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:06:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:32,841 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2024-11-07 00:06:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:06:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2024-11-07 00:06:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:32,843 INFO L225 Difference]: With dead ends: 230 [2024-11-07 00:06:32,843 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 00:06:32,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:06:32,844 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:32,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:06:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 00:06:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-07 00:06:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 124 states have internal predecessors, (179), 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:06:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2024-11-07 00:06:32,858 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 36 [2024-11-07 00:06:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:32,859 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2024-11-07 00:06:32,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:06:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2024-11-07 00:06:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 00:06:32,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:32,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:32,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:06:32,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 214545292, now seen corresponding path program 1 times [2024-11-07 00:06:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782296567] [2024-11-07 00:06:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:33,169 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:06:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:33,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782296567] [2024-11-07 00:06:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782296567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:06:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211709037] [2024-11-07 00:06:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:06:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:06:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:06:33,174 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:33,237 INFO L93 Difference]: Finished difference Result 133 states and 188 transitions. [2024-11-07 00:06:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:06:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 00:06:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:33,244 INFO L225 Difference]: With dead ends: 133 [2024-11-07 00:06:33,244 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 00:06:33,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:06:33,245 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:33,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:06:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 00:06:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-07 00:06:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 130 states have internal predecessors, (184), 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:06:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 184 transitions. [2024-11-07 00:06:33,274 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 184 transitions. Word has length 37 [2024-11-07 00:06:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:33,275 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 184 transitions. [2024-11-07 00:06:33,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 184 transitions. [2024-11-07 00:06:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 00:06:33,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:33,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:33,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:06:33,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:33,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash -63465668, now seen corresponding path program 1 times [2024-11-07 00:06:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:33,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558252742] [2024-11-07 00:06:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:33,327 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:06:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558252742] [2024-11-07 00:06:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558252742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954797836] [2024-11-07 00:06:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:33,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:33,329 INFO L87 Difference]: Start difference. First operand 131 states and 184 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:33,344 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2024-11-07 00:06:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 00:06:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:33,346 INFO L225 Difference]: With dead ends: 253 [2024-11-07 00:06:33,346 INFO L226 Difference]: Without dead ends: 189 [2024-11-07 00:06:33,346 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:06:33,347 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:33,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-07 00:06:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-11-07 00:06:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.424731182795699) internal successors, (265), 186 states have internal predecessors, (265), 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:06:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2024-11-07 00:06:33,357 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 38 [2024-11-07 00:06:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2024-11-07 00:06:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2024-11-07 00:06:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 00:06:33,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:33,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:33,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:06:33,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2016032828, now seen corresponding path program 1 times [2024-11-07 00:06:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645754567] [2024-11-07 00:06:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:33,407 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:06:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645754567] [2024-11-07 00:06:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645754567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827916190] [2024-11-07 00:06:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:33,414 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:33,437 INFO L93 Difference]: Finished difference Result 489 states and 705 transitions. [2024-11-07 00:06:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 00:06:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:33,439 INFO L225 Difference]: With dead ends: 489 [2024-11-07 00:06:33,440 INFO L226 Difference]: Without dead ends: 326 [2024-11-07 00:06:33,440 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:06:33,441 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:33,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-07 00:06:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-11-07 00:06:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.414860681114551) internal successors, (457), 323 states have internal predecessors, (457), 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:06:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2024-11-07 00:06:33,462 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 38 [2024-11-07 00:06:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:33,463 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2024-11-07 00:06:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2024-11-07 00:06:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 00:06:33,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:33,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:06:33,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:33,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:33,465 INFO L85 PathProgramCache]: Analyzing trace with hash -498001604, now seen corresponding path program 1 times [2024-11-07 00:06:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:33,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636933905] [2024-11-07 00:06:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:33,513 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:06:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636933905] [2024-11-07 00:06:33,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636933905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:33,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35355245] [2024-11-07 00:06:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:33,519 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:33,543 INFO L93 Difference]: Finished difference Result 876 states and 1239 transitions. [2024-11-07 00:06:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:33,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 00:06:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:33,547 INFO L225 Difference]: With dead ends: 876 [2024-11-07 00:06:33,547 INFO L226 Difference]: Without dead ends: 576 [2024-11-07 00:06:33,548 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:06:33,549 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:33,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-07 00:06:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2024-11-07 00:06:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.3839441535776615) internal successors, (793), 573 states have internal predecessors, (793), 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:06:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 793 transitions. [2024-11-07 00:06:33,573 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 793 transitions. Word has length 38 [2024-11-07 00:06:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 793 transitions. [2024-11-07 00:06:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2024-11-07 00:06:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:06:33,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:33,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:33,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:06:33,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:33,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash 201693929, now seen corresponding path program 1 times [2024-11-07 00:06:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:33,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438184467] [2024-11-07 00:06:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:06:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438184467] [2024-11-07 00:06:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438184467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11737325] [2024-11-07 00:06:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:33,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:33,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:33,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:33,709 INFO L87 Difference]: Start difference. First operand 574 states and 793 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:06:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:33,822 INFO L93 Difference]: Finished difference Result 2206 states and 3069 transitions. [2024-11-07 00:06:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:06:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:06:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:33,831 INFO L225 Difference]: With dead ends: 2206 [2024-11-07 00:06:33,832 INFO L226 Difference]: Without dead ends: 1804 [2024-11-07 00:06:33,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:06:33,834 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 159 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:33,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 294 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:06:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-07 00:06:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1050. [2024-11-07 00:06:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 1.3813155386081983) internal successors, (1449), 1049 states have internal predecessors, (1449), 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:06:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1449 transitions. [2024-11-07 00:06:33,894 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1449 transitions. Word has length 53 [2024-11-07 00:06:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:33,894 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1449 transitions. [2024-11-07 00:06:33,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:06:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1449 transitions. [2024-11-07 00:06:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:06:33,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:33,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:33,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:06:33,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:33,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2013774871, now seen corresponding path program 1 times [2024-11-07 00:06:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:33,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151643356] [2024-11-07 00:06:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:06:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151643356] [2024-11-07 00:06:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151643356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074529522] [2024-11-07 00:06:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:34,030 INFO L87 Difference]: Start difference. First operand 1050 states and 1449 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:06:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:34,143 INFO L93 Difference]: Finished difference Result 2754 states and 3829 transitions. [2024-11-07 00:06:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:06:34,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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 53 [2024-11-07 00:06:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:34,154 INFO L225 Difference]: With dead ends: 2754 [2024-11-07 00:06:34,154 INFO L226 Difference]: Without dead ends: 2204 [2024-11-07 00:06:34,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:06:34,156 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 163 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:34,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 269 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2024-11-07 00:06:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1798. [2024-11-07 00:06:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.3784084585420144) internal successors, (2477), 1797 states have internal predecessors, (2477), 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:06:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2477 transitions. [2024-11-07 00:06:34,239 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2477 transitions. Word has length 53 [2024-11-07 00:06:34,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:34,239 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2477 transitions. [2024-11-07 00:06:34,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:06:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2477 transitions. [2024-11-07 00:06:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:06:34,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:34,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:34,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:06:34,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -232842007, now seen corresponding path program 1 times [2024-11-07 00:06:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045384282] [2024-11-07 00:06:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 00:06:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045384282] [2024-11-07 00:06:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045384282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:06:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46517868] [2024-11-07 00:06:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:06:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:06:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:06:34,370 INFO L87 Difference]: Start difference. First operand 1798 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:06:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:34,501 INFO L93 Difference]: Finished difference Result 3302 states and 4585 transitions. [2024-11-07 00:06:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:06:34,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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 53 [2024-11-07 00:06:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:34,512 INFO L225 Difference]: With dead ends: 3302 [2024-11-07 00:06:34,512 INFO L226 Difference]: Without dead ends: 2752 [2024-11-07 00:06:34,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:06:34,514 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 167 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:34,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 280 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2024-11-07 00:06:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2346. [2024-11-07 00:06:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.378678038379531) internal successors, (3233), 2345 states have internal predecessors, (3233), 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:06:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3233 transitions. [2024-11-07 00:06:34,616 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3233 transitions. Word has length 53 [2024-11-07 00:06:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:34,617 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3233 transitions. [2024-11-07 00:06:34,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:06:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3233 transitions. [2024-11-07 00:06:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:06:34,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:34,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:06:34,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1948699024, now seen corresponding path program 1 times [2024-11-07 00:06:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551093679] [2024-11-07 00:06:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:34,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551093679] [2024-11-07 00:06:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551093679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:34,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:34,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530139925] [2024-11-07 00:06:34,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:34,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:34,734 INFO L87 Difference]: Start difference. First operand 2346 states and 3233 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:06:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:34,807 INFO L93 Difference]: Finished difference Result 4670 states and 6443 transitions. [2024-11-07 00:06:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:34,808 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:06:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:34,818 INFO L225 Difference]: With dead ends: 4670 [2024-11-07 00:06:34,819 INFO L226 Difference]: Without dead ends: 2348 [2024-11-07 00:06:34,823 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:06:34,824 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:34,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2024-11-07 00:06:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2346. [2024-11-07 00:06:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.3573560767590618) internal successors, (3183), 2345 states have internal predecessors, (3183), 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:06:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3183 transitions. [2024-11-07 00:06:34,919 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3183 transitions. Word has length 54 [2024-11-07 00:06:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3183 transitions. [2024-11-07 00:06:34,920 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:06:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3183 transitions. [2024-11-07 00:06:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:06:34,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:34,921 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] [2024-11-07 00:06:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:06:34,921 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash 443391553, now seen corresponding path program 1 times [2024-11-07 00:06:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707292764] [2024-11-07 00:06:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707292764] [2024-11-07 00:06:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707292764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:35,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623911889] [2024-11-07 00:06:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:35,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:35,034 INFO L87 Difference]: Start difference. First operand 2346 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:35,080 INFO L93 Difference]: Finished difference Result 3265 states and 4443 transitions. [2024-11-07 00:06:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:06:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:35,085 INFO L225 Difference]: With dead ends: 3265 [2024-11-07 00:06:35,085 INFO L226 Difference]: Without dead ends: 943 [2024-11-07 00:06:35,088 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:06:35,089 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:35,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-07 00:06:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 935. [2024-11-07 00:06:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.3468950749464668) internal successors, (1258), 934 states have internal predecessors, (1258), 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:06:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1258 transitions. [2024-11-07 00:06:35,132 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1258 transitions. Word has length 55 [2024-11-07 00:06:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:35,132 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1258 transitions. [2024-11-07 00:06:35,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1258 transitions. [2024-11-07 00:06:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:06:35,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:35,134 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:35,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:06:35,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1656493662, now seen corresponding path program 1 times [2024-11-07 00:06:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413175484] [2024-11-07 00:06:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413175484] [2024-11-07 00:06:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413175484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:06:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:06:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:06:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244727421] [2024-11-07 00:06:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:06:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:06:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:06:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:06:35,229 INFO L87 Difference]: Start difference. First operand 935 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:35,253 INFO L93 Difference]: Finished difference Result 1389 states and 1872 transitions. [2024-11-07 00:06:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:06:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:06:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:35,256 INFO L225 Difference]: With dead ends: 1389 [2024-11-07 00:06:35,256 INFO L226 Difference]: Without dead ends: 487 [2024-11-07 00:06:35,258 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:06:35,259 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:35,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:06:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-07 00:06:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2024-11-07 00:06:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 484 states have internal predecessors, (637), 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:06:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 637 transitions. [2024-11-07 00:06:35,278 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 637 transitions. Word has length 56 [2024-11-07 00:06:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:35,279 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 637 transitions. [2024-11-07 00:06:35,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 637 transitions. [2024-11-07 00:06:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 00:06:35,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:35,280 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] [2024-11-07 00:06:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:06:35,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2139764684, now seen corresponding path program 1 times [2024-11-07 00:06:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023928378] [2024-11-07 00:06:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023928378] [2024-11-07 00:06:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023928378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:06:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088529522] [2024-11-07 00:06:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:36,514 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:06:36,529 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:06:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:36,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 00:06:36,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:06:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:06:36,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:06:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088529522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:37,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-11-07 00:06:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500346250] [2024-11-07 00:06:37,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:37,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:06:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:06:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:06:37,143 INFO L87 Difference]: Start difference. First operand 485 states and 637 transitions. Second operand has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 19 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:39,020 INFO L93 Difference]: Finished difference Result 2787 states and 3660 transitions. [2024-11-07 00:06:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-07 00:06:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 19 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-07 00:06:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:39,030 INFO L225 Difference]: With dead ends: 2787 [2024-11-07 00:06:39,031 INFO L226 Difference]: Without dead ends: 2335 [2024-11-07 00:06:39,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=562, Invalid=2518, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 00:06:39,036 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 934 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:39,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 483 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:06:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2024-11-07 00:06:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2217. [2024-11-07 00:06:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2216 states have (on average 1.263537906137184) internal successors, (2800), 2216 states have internal predecessors, (2800), 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:06:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2800 transitions. [2024-11-07 00:06:39,111 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2800 transitions. Word has length 58 [2024-11-07 00:06:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:39,111 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 2800 transitions. [2024-11-07 00:06:39,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 19 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:06:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2800 transitions. [2024-11-07 00:06:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:06:39,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:39,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:39,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 00:06:39,320 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,SelfDestructingSolverStorable15 [2024-11-07 00:06:39,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -676295907, now seen corresponding path program 1 times [2024-11-07 00:06:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366805874] [2024-11-07 00:06:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366805874] [2024-11-07 00:06:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366805874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:06:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214923232] [2024-11-07 00:06:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:39,737 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:06:39,744 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:06:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:39,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 00:06:39,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:06:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:40,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214923232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:41,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-07 00:06:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886152763] [2024-11-07 00:06:41,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:06:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:06:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:06:41,013 INFO L87 Difference]: Start difference. First operand 2217 states and 2800 transitions. Second operand has 22 states, 22 states have (on average 5.7272727272727275) internal successors, (126), 21 states have internal predecessors, (126), 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:06:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:41,386 INFO L93 Difference]: Finished difference Result 5775 states and 7311 transitions. [2024-11-07 00:06:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:06:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7272727272727275) internal successors, (126), 21 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 00:06:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:41,401 INFO L225 Difference]: With dead ends: 5775 [2024-11-07 00:06:41,402 INFO L226 Difference]: Without dead ends: 3811 [2024-11-07 00:06:41,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:06:41,406 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 672 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:41,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 294 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:06:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2024-11-07 00:06:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3807. [2024-11-07 00:06:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3806 states have (on average 1.2569626904887021) internal successors, (4784), 3806 states have internal predecessors, (4784), 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:06:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 4784 transitions. [2024-11-07 00:06:41,583 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 4784 transitions. Word has length 59 [2024-11-07 00:06:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:41,583 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 4784 transitions. [2024-11-07 00:06:41,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7272727272727275) internal successors, (126), 21 states have internal predecessors, (126), 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:06:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 4784 transitions. [2024-11-07 00:06:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:06:41,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:41,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:06:41,606 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:06:41,789 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,SelfDestructingSolverStorable16 [2024-11-07 00:06:41,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1889442531, now seen corresponding path program 1 times [2024-11-07 00:06:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132635278] [2024-11-07 00:06:41,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:42,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132635278] [2024-11-07 00:06:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132635278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:06:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994325137] [2024-11-07 00:06:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:42,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:42,642 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:06:42,647 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:06:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:42,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 00:06:42,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:06:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:43,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994325137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:44,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-11-07 00:06:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030364163] [2024-11-07 00:06:44,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:44,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 00:06:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 00:06:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-11-07 00:06:44,014 INFO L87 Difference]: Start difference. First operand 3807 states and 4784 transitions. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 25 states have internal predecessors, (154), 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:06:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:44,513 INFO L93 Difference]: Finished difference Result 6965 states and 8787 transitions. [2024-11-07 00:06:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:06:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 25 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 00:06:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:44,528 INFO L225 Difference]: With dead ends: 6965 [2024-11-07 00:06:44,529 INFO L226 Difference]: Without dead ends: 3997 [2024-11-07 00:06:44,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 00:06:44,535 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 597 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:44,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 298 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:06:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2024-11-07 00:06:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3707. [2024-11-07 00:06:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3706 states have (on average 1.2393416082029143) internal successors, (4593), 3706 states have internal predecessors, (4593), 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:06:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4593 transitions. [2024-11-07 00:06:44,668 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4593 transitions. Word has length 59 [2024-11-07 00:06:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:44,669 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 4593 transitions. [2024-11-07 00:06:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 25 states have internal predecessors, (154), 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:06:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4593 transitions. [2024-11-07 00:06:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:06:44,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:44,671 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] [2024-11-07 00:06:44,694 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:06:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:44,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -910303857, now seen corresponding path program 1 times [2024-11-07 00:06:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642646512] [2024-11-07 00:06:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642646512] [2024-11-07 00:06:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642646512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:06:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575057538] [2024-11-07 00:06:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:45,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:45,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:45,346 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:06:45,354 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:06:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:45,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 00:06:45,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:06:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:46,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575057538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:46,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-07 00:06:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101123676] [2024-11-07 00:06:46,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:46,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 00:06:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 00:06:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:06:46,713 INFO L87 Difference]: Start difference. First operand 3707 states and 4593 transitions. Second operand has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 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:06:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:06:49,483 INFO L93 Difference]: Finished difference Result 10418 states and 12912 transitions. [2024-11-07 00:06:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-07 00:06:49,484 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 00:06:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:06:49,513 INFO L225 Difference]: With dead ends: 10418 [2024-11-07 00:06:49,513 INFO L226 Difference]: Without dead ends: 7250 [2024-11-07 00:06:49,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=931, Invalid=3899, Unknown=0, NotChecked=0, Total=4830 [2024-11-07 00:06:49,520 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1487 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:06:49,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1000 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:06:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2024-11-07 00:06:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 6254. [2024-11-07 00:06:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.2208539900847593) internal successors, (7634), 6253 states have internal predecessors, (7634), 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:06:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 7634 transitions. [2024-11-07 00:06:49,759 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 7634 transitions. Word has length 59 [2024-11-07 00:06:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:06:49,759 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 7634 transitions. [2024-11-07 00:06:49,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.4) internal successors, (162), 30 states have internal predecessors, (162), 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:06:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 7634 transitions. [2024-11-07 00:06:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 00:06:49,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:06:49,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] [2024-11-07 00:06:49,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 00:06:49,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:49,963 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:06:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:06:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -960442930, now seen corresponding path program 1 times [2024-11-07 00:06:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:06:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541518452] [2024-11-07 00:06:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:06:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:06:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541518452] [2024-11-07 00:06:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541518452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:06:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184354405] [2024-11-07 00:06:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:06:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:06:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:06:50,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:06:50,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 00:06:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:06:50,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 00:06:50,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:06:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:52,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184354405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:56,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 19] total 53 [2024-11-07 00:06:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363296737] [2024-11-07 00:06:56,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-07 00:06:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-07 00:06:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 00:06:56,476 INFO L87 Difference]: Start difference. First operand 6254 states and 7634 transitions. Second operand has 53 states, 53 states have (on average 3.1320754716981134) internal successors, (166), 53 states have internal predecessors, (166), 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:07:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:07:06,779 INFO L93 Difference]: Finished difference Result 8396 states and 10303 transitions. [2024-11-07 00:07:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-07 00:07:06,780 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.1320754716981134) internal successors, (166), 53 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 00:07:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:07:06,792 INFO L225 Difference]: With dead ends: 8396 [2024-11-07 00:07:06,792 INFO L226 Difference]: Without dead ends: 4919 [2024-11-07 00:07:06,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3319 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2731, Invalid=10841, Unknown=0, NotChecked=0, Total=13572 [2024-11-07 00:07:06,801 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2345 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:07:06,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 1444 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:07:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2024-11-07 00:07:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 4609. [2024-11-07 00:07:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4608 states have (on average 1.2180989583333333) internal successors, (5613), 4608 states have internal predecessors, (5613), 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:07:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 5613 transitions. [2024-11-07 00:07:06,981 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 5613 transitions. Word has length 60 [2024-11-07 00:07:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:07:06,982 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 5613 transitions. [2024-11-07 00:07:06,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.1320754716981134) internal successors, (166), 53 states have internal predecessors, (166), 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:07:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 5613 transitions. [2024-11-07 00:07:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 00:07:06,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:07:06,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:07:07,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 00:07:07,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:07,189 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:07:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:07:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash -494193176, now seen corresponding path program 1 times [2024-11-07 00:07:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:07:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752006262] [2024-11-07 00:07:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:07:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:07:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752006262] [2024-11-07 00:07:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752006262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:07:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349746267] [2024-11-07 00:07:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:07:08,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:07:08,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 00:07:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:08,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 00:07:08,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:07:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:09,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:07:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349746267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:07:10,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:07:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 38 [2024-11-07 00:07:10,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482223937] [2024-11-07 00:07:10,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:07:10,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 00:07:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:07:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 00:07:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1273, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 00:07:10,633 INFO L87 Difference]: Start difference. First operand 4609 states and 5613 transitions. Second operand has 38 states, 38 states have (on average 3.973684210526316) internal successors, (151), 38 states have internal predecessors, (151), 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:07:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:07:15,969 INFO L93 Difference]: Finished difference Result 12115 states and 14984 transitions. [2024-11-07 00:07:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 00:07:15,970 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.973684210526316) internal successors, (151), 38 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 00:07:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:07:16,001 INFO L225 Difference]: With dead ends: 12115 [2024-11-07 00:07:16,002 INFO L226 Difference]: Without dead ends: 9720 [2024-11-07 00:07:16,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1404, Invalid=4916, Unknown=0, NotChecked=0, Total=6320 [2024-11-07 00:07:16,020 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2795 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2795 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:07:16,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2795 Valid, 1466 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:07:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9720 states. [2024-11-07 00:07:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9720 to 3368. [2024-11-07 00:07:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.2177012177012176) internal successors, (4100), 3367 states have internal predecessors, (4100), 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:07:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4100 transitions. [2024-11-07 00:07:16,262 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4100 transitions. Word has length 62 [2024-11-07 00:07:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:07:16,262 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4100 transitions. [2024-11-07 00:07:16,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.973684210526316) internal successors, (151), 38 states have internal predecessors, (151), 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:07:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4100 transitions. [2024-11-07 00:07:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:07:16,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:07:16,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:07:16,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 00:07:16,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-07 00:07:16,469 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:07:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:07:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -651141410, now seen corresponding path program 1 times [2024-11-07 00:07:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:07:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762593528] [2024-11-07 00:07:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:07:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:07:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762593528] [2024-11-07 00:07:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762593528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:07:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781526959] [2024-11-07 00:07:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:17,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:17,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:07:17,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:07:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 00:07:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:17,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 00:07:17,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:07:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:18,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:07:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781526959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:07:20,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:07:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2024-11-07 00:07:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769337778] [2024-11-07 00:07:20,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:07:20,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 00:07:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:07:20,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 00:07:20,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2024-11-07 00:07:20,098 INFO L87 Difference]: Start difference. First operand 3368 states and 4100 transitions. Second operand has 31 states, 31 states have (on average 7.387096774193548) internal successors, (229), 30 states have internal predecessors, (229), 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:07:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:07:21,615 INFO L93 Difference]: Finished difference Result 5304 states and 6487 transitions. [2024-11-07 00:07:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 00:07:21,616 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.387096774193548) internal successors, (229), 30 states have internal predecessors, (229), 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 98 [2024-11-07 00:07:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:07:21,633 INFO L225 Difference]: With dead ends: 5304 [2024-11-07 00:07:21,634 INFO L226 Difference]: Without dead ends: 3418 [2024-11-07 00:07:21,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=666, Invalid=2414, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 00:07:21,645 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 918 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:07:21,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 719 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:07:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2024-11-07 00:07:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3368. [2024-11-07 00:07:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.2087912087912087) internal successors, (4070), 3367 states have internal predecessors, (4070), 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:07:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4070 transitions. [2024-11-07 00:07:21,927 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4070 transitions. Word has length 98 [2024-11-07 00:07:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:07:21,927 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4070 transitions. [2024-11-07 00:07:21,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.387096774193548) internal successors, (229), 30 states have internal predecessors, (229), 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:07:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4070 transitions. [2024-11-07 00:07:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:07:21,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:07:21,929 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:07:21,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 00:07:22,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:22,130 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:07:22,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:07:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1864288034, now seen corresponding path program 1 times [2024-11-07 00:07:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:07:22,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518038920] [2024-11-07 00:07:22,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:22,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:07:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 30 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:07:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518038920] [2024-11-07 00:07:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518038920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:07:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702699347] [2024-11-07 00:07:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:07:22,981 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:07:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 00:07:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:23,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 00:07:23,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:07:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:23,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:07:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702699347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:07:25,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:07:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-11-07 00:07:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938466704] [2024-11-07 00:07:25,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:07:25,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 00:07:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:07:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 00:07:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-11-07 00:07:25,591 INFO L87 Difference]: Start difference. First operand 3368 states and 4070 transitions. Second operand has 32 states, 32 states have (on average 8.53125) internal successors, (273), 31 states have internal predecessors, (273), 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:07:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:07:28,780 INFO L93 Difference]: Finished difference Result 6122 states and 7436 transitions. [2024-11-07 00:07:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-07 00:07:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.53125) internal successors, (273), 31 states have internal predecessors, (273), 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 98 [2024-11-07 00:07:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:07:28,800 INFO L225 Difference]: With dead ends: 6122 [2024-11-07 00:07:28,800 INFO L226 Difference]: Without dead ends: 3616 [2024-11-07 00:07:28,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1213, Invalid=4639, Unknown=0, NotChecked=0, Total=5852 [2024-11-07 00:07:28,810 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1059 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:07:28,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 965 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:07:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-11-07 00:07:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 3368. [2024-11-07 00:07:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.1888921888921888) internal successors, (4003), 3367 states have internal predecessors, (4003), 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:07:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4003 transitions. [2024-11-07 00:07:29,178 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4003 transitions. Word has length 98 [2024-11-07 00:07:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:07:29,178 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4003 transitions. [2024-11-07 00:07:29,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.53125) internal successors, (273), 31 states have internal predecessors, (273), 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:07:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4003 transitions. [2024-11-07 00:07:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:07:29,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:07:29,188 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:07:29,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-07 00:07:29,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:29,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:07:29,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:07:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1708375633, now seen corresponding path program 1 times [2024-11-07 00:07:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:07:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263452978] [2024-11-07 00:07:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:07:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:07:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263452978] [2024-11-07 00:07:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263452978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:07:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800066145] [2024-11-07 00:07:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:07:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:07:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:07:30,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:07:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 00:07:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:07:30,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 00:07:30,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:07:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:33,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:07:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:07:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800066145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:07:39,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:07:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 22] total 64 [2024-11-07 00:07:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109355060] [2024-11-07 00:07:39,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:07:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-07 00:07:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:07:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-07 00:07:39,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3688, Unknown=0, NotChecked=0, Total=4032 [2024-11-07 00:07:39,561 INFO L87 Difference]: Start difference. First operand 3368 states and 4003 transitions. Second operand has 64 states, 64 states have (on average 4.390625) internal successors, (281), 64 states have internal predecessors, (281), 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)