./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label24.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/eca-rers2012/Problem15_label24.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', 'cb0c3ec54bfe7ca5ae5031ed15e31d11f389c6f34b7a5ddeb0a5af3b415963cc'] 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/eca-rers2012/Problem15_label24.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 cb0c3ec54bfe7ca5ae5031ed15e31d11f389c6f34b7a5ddeb0a5af3b415963cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:56:38,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:56:38,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:56:38,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:56:38,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:56:38,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:56:38,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:56:38,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:56:38,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:56:38,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:56:38,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:56:38,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:56:38,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:56:38,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:56:38,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:56:38,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:56:38,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:56:38,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:38,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:56:38,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:56:38,169 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 -> cb0c3ec54bfe7ca5ae5031ed15e31d11f389c6f34b7a5ddeb0a5af3b415963cc [2024-11-06 19:56:38,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:56:38,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:56:38,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:56:38,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:56:38,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:56:38,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label24.c [2024-11-06 19:56:39,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:56:40,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:56:40,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label24.c [2024-11-06 19:56:40,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea3f41a0/2e198f7eaa964c7c94adaca3bbdbf27e/FLAGf8a2d51e8 [2024-11-06 19:56:40,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea3f41a0/2e198f7eaa964c7c94adaca3bbdbf27e [2024-11-06 19:56:40,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:56:40,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:56:40,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:40,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:56:40,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:56:40,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:40" (1/1) ... [2024-11-06 19:56:40,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431444cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:40, skipping insertion in model container [2024-11-06 19:56:40,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:40" (1/1) ... [2024-11-06 19:56:40,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:56:40,584 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/eca-rers2012/Problem15_label24.c[4739,4752] [2024-11-06 19:56:40,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:40,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:56:41,006 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/eca-rers2012/Problem15_label24.c[4739,4752] [2024-11-06 19:56:41,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:41,205 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:56:41,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41 WrapperNode [2024-11-06 19:56:41,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:41,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:41,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:56:41,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:56:41,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,427 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:56:41,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:41,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:56:41,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:56:41,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:56:41,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,588 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-06 19:56:41,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:56:41,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:56:41,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:56:41,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:56:41,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (1/1) ... [2024-11-06 19:56:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:56:41,847 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-06 19:56:41,850 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-06 19:56:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:56:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:56:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:56:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:56:41,943 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:56:41,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:56:44,425 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:56:44,426 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:56:44,448 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:56:44,448 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:56:44,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:44 BoogieIcfgContainer [2024-11-06 19:56:44,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:56:44,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:56:44,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:56:44,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:56:44,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:56:40" (1/3) ... [2024-11-06 19:56:44,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a3e6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:44, skipping insertion in model container [2024-11-06 19:56:44,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:41" (2/3) ... [2024-11-06 19:56:44,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a3e6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:44, skipping insertion in model container [2024-11-06 19:56:44,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:44" (3/3) ... [2024-11-06 19:56:44,461 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label24.c [2024-11-06 19:56:44,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:56:44,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:56:44,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:56:44,550 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;@5769f40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:56:44,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:56:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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-06 19:56:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 19:56:44,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:44,568 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-06 19:56:44,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2024-11-06 19:56:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58738040] [2024-11-06 19:56:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:44,902 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-06 19:56:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:44,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58738040] [2024-11-06 19:56:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58738040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441233984] [2024-11-06 19:56:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:44,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:44,931 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 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-06 19:56:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:46,910 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-06 19:56:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 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-06 19:56:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:46,923 INFO L225 Difference]: With dead ends: 1154 [2024-11-06 19:56:46,923 INFO L226 Difference]: Without dead ends: 665 [2024-11-06 19:56:46,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:46,934 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 283 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:46,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:56:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-06 19:56:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-06 19:56:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 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-06 19:56:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-06 19:56:47,020 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 38 [2024-11-06 19:56:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:47,020 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-06 19:56:47,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 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-06 19:56:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-06 19:56:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-06 19:56:47,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:47,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:56:47,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1506218363, now seen corresponding path program 1 times [2024-11-06 19:56:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865586957] [2024-11-06 19:56:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865586957] [2024-11-06 19:56:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865586957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:47,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490690777] [2024-11-06 19:56:47,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:47,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:47,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:47,477 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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-06 19:56:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:48,701 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-06 19:56:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:48,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-06 19:56:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:48,705 INFO L225 Difference]: With dead ends: 1624 [2024-11-06 19:56:48,705 INFO L226 Difference]: Without dead ends: 963 [2024-11-06 19:56:48,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:48,708 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:48,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:56:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-06 19:56:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-06 19:56:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 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-06 19:56:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-06 19:56:48,742 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 103 [2024-11-06 19:56:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:48,743 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-06 19:56:48,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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-06 19:56:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-06 19:56:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 19:56:48,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:48,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:48,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:56:48,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:48,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2099005740, now seen corresponding path program 1 times [2024-11-06 19:56:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160496617] [2024-11-06 19:56:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160496617] [2024-11-06 19:56:48,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160496617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:48,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:48,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512701417] [2024-11-06 19:56:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:48,922 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-06 19:56:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:50,350 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-06 19:56:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-06 19:56:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:50,356 INFO L225 Difference]: With dead ends: 2229 [2024-11-06 19:56:50,356 INFO L226 Difference]: Without dead ends: 1567 [2024-11-06 19:56:50,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:50,358 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:50,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:56:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-06 19:56:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-06 19:56:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 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-06 19:56:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2024-11-06 19:56:50,382 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 108 [2024-11-06 19:56:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:50,383 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2024-11-06 19:56:50,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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-06 19:56:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2024-11-06 19:56:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-06 19:56:50,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:50,386 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:56:50,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1721229625, now seen corresponding path program 1 times [2024-11-06 19:56:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900941393] [2024-11-06 19:56:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:50,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900941393] [2024-11-06 19:56:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900941393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:50,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308994907] [2024-11-06 19:56:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:50,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:50,723 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-06 19:56:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:53,208 INFO L93 Difference]: Finished difference Result 4670 states and 6170 transitions. [2024-11-06 19:56:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-11-06 19:56:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:53,221 INFO L225 Difference]: With dead ends: 4670 [2024-11-06 19:56:53,221 INFO L226 Difference]: Without dead ends: 3406 [2024-11-06 19:56:53,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:53,224 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 486 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:53,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 379 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:56:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2024-11-06 19:56:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2024-11-06 19:56:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 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-06 19:56:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2024-11-06 19:56:53,280 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 204 [2024-11-06 19:56:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:53,281 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2024-11-06 19:56:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-06 19:56:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2024-11-06 19:56:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-06 19:56:53,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:53,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:53,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:56:53,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:53,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 285319535, now seen corresponding path program 1 times [2024-11-06 19:56:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422284124] [2024-11-06 19:56:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:56:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422284124] [2024-11-06 19:56:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422284124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901406305] [2024-11-06 19:56:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:53,520 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-06 19:56:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:54,762 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2024-11-06 19:56:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 208 [2024-11-06 19:56:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:54,780 INFO L225 Difference]: With dead ends: 8563 [2024-11-06 19:56:54,781 INFO L226 Difference]: Without dead ends: 5483 [2024-11-06 19:56:54,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:54,787 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:54,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:56:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-06 19:56:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-06 19:56:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 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-06 19:56:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2024-11-06 19:56:54,883 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 208 [2024-11-06 19:56:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:54,885 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2024-11-06 19:56:54,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-06 19:56:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2024-11-06 19:56:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-06 19:56:54,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:54,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:56:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:56:54,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 133316789, now seen corresponding path program 1 times [2024-11-06 19:56:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999725950] [2024-11-06 19:56:54,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-06 19:56:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999725950] [2024-11-06 19:56:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999725950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605458254] [2024-11-06 19:56:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:55,636 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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-06 19:56:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:56,705 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2024-11-06 19:56:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 310 [2024-11-06 19:56:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:56,719 INFO L225 Difference]: With dead ends: 10655 [2024-11-06 19:56:56,720 INFO L226 Difference]: Without dead ends: 5478 [2024-11-06 19:56:56,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:56,725 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:56,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:56:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-06 19:56:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-06 19:56:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 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-06 19:56:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2024-11-06 19:56:56,816 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 310 [2024-11-06 19:56:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:56,816 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2024-11-06 19:56:56,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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-06 19:56:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2024-11-06 19:56:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-06 19:56:56,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:56,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:56:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:56:56,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1264220026, now seen corresponding path program 1 times [2024-11-06 19:56:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918267016] [2024-11-06 19:56:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:56:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918267016] [2024-11-06 19:56:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918267016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109676294] [2024-11-06 19:56:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:57,148 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-06 19:56:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:58,574 INFO L93 Difference]: Finished difference Result 11851 states and 14151 transitions. [2024-11-06 19:56:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 325 [2024-11-06 19:56:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:58,588 INFO L225 Difference]: With dead ends: 11851 [2024-11-06 19:56:58,588 INFO L226 Difference]: Without dead ends: 6674 [2024-11-06 19:56:58,591 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-06 19:56:58,591 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 277 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:58,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:56:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-06 19:56:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2024-11-06 19:56:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1805128205128206) internal successors, (5755), 4875 states have internal predecessors, (5755), 0 states have call successors, (0), 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-06 19:56:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5755 transitions. [2024-11-06 19:56:58,663 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5755 transitions. Word has length 325 [2024-11-06 19:56:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:58,663 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5755 transitions. [2024-11-06 19:56:58,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-06 19:56:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5755 transitions. [2024-11-06 19:56:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-06 19:56:58,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:58,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:56:58,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:56:58,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:58,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash 194442375, now seen corresponding path program 1 times [2024-11-06 19:56:58,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068113438] [2024-11-06 19:56:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:58,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:56:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068113438] [2024-11-06 19:56:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068113438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163529533] [2024-11-06 19:56:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:59,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:59,044 INFO L87 Difference]: Start difference. First operand 4876 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-06 19:57:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:00,452 INFO L93 Difference]: Finished difference Result 11852 states and 14244 transitions. [2024-11-06 19:57:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:00,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 384 [2024-11-06 19:57:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:00,473 INFO L225 Difference]: With dead ends: 11852 [2024-11-06 19:57:00,473 INFO L226 Difference]: Without dead ends: 7277 [2024-11-06 19:57:00,478 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-06 19:57:00,478 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 290 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:00,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:57:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2024-11-06 19:57:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 6380. [2024-11-06 19:57:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1558237968333596) internal successors, (7373), 6379 states have internal predecessors, (7373), 0 states have call successors, (0), 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-06 19:57:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7373 transitions. [2024-11-06 19:57:00,580 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7373 transitions. Word has length 384 [2024-11-06 19:57:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:00,581 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7373 transitions. [2024-11-06 19:57:00,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-06 19:57:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7373 transitions. [2024-11-06 19:57:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-11-06 19:57:00,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:00,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:00,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:57:00,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:00,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2101928027, now seen corresponding path program 1 times [2024-11-06 19:57:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799298092] [2024-11-06 19:57:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:57:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799298092] [2024-11-06 19:57:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799298092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217536948] [2024-11-06 19:57:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:00,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:00,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:00,912 INFO L87 Difference]: Start difference. First operand 6380 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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-06 19:57:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:02,070 INFO L93 Difference]: Finished difference Result 14563 states and 17152 transitions. [2024-11-06 19:57:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 390 [2024-11-06 19:57:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:02,094 INFO L225 Difference]: With dead ends: 14563 [2024-11-06 19:57:02,094 INFO L226 Difference]: Without dead ends: 8484 [2024-11-06 19:57:02,101 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-06 19:57:02,102 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 250 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:02,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 601 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:57:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2024-11-06 19:57:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 8182. [2024-11-06 19:57:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8182 states, 8181 states have (on average 1.135558000244469) internal successors, (9290), 8181 states have internal predecessors, (9290), 0 states have call successors, (0), 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-06 19:57:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 9290 transitions. [2024-11-06 19:57:02,248 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 9290 transitions. Word has length 390 [2024-11-06 19:57:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:02,248 INFO L471 AbstractCegarLoop]: Abstraction has 8182 states and 9290 transitions. [2024-11-06 19:57:02,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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-06 19:57:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 9290 transitions. [2024-11-06 19:57:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-06 19:57:02,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:02,263 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:57:02,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1015134150, now seen corresponding path program 1 times [2024-11-06 19:57:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591246315] [2024-11-06 19:57:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:57:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591246315] [2024-11-06 19:57:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591246315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066332369] [2024-11-06 19:57:02,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:02,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:02,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:02,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:02,708 INFO L87 Difference]: Start difference. First operand 8182 states and 9290 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-06 19:57:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:04,238 INFO L93 Difference]: Finished difference Result 17857 states and 20650 transitions. [2024-11-06 19:57:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:04,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 406 [2024-11-06 19:57:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:04,259 INFO L225 Difference]: With dead ends: 17857 [2024-11-06 19:57:04,260 INFO L226 Difference]: Without dead ends: 9976 [2024-11-06 19:57:04,269 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-06 19:57:04,269 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:04,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 19:57:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9976 states. [2024-11-06 19:57:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9976 to 9673. [2024-11-06 19:57:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9673 states, 9672 states have (on average 1.1267576509511994) internal successors, (10898), 9672 states have internal predecessors, (10898), 0 states have call successors, (0), 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-06 19:57:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9673 states to 9673 states and 10898 transitions. [2024-11-06 19:57:04,412 INFO L78 Accepts]: Start accepts. Automaton has 9673 states and 10898 transitions. Word has length 406 [2024-11-06 19:57:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:04,413 INFO L471 AbstractCegarLoop]: Abstraction has 9673 states and 10898 transitions. [2024-11-06 19:57:04,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-06 19:57:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9673 states and 10898 transitions. [2024-11-06 19:57:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-06 19:57:04,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:04,422 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:57:04,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 365821965, now seen corresponding path program 1 times [2024-11-06 19:57:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698584002] [2024-11-06 19:57:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-06 19:57:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698584002] [2024-11-06 19:57:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698584002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270771874] [2024-11-06 19:57:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:04,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:04,765 INFO L87 Difference]: Start difference. First operand 9673 states and 10898 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-06 19:57:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:06,113 INFO L93 Difference]: Finished difference Result 21436 states and 24446 transitions. [2024-11-06 19:57:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 502 [2024-11-06 19:57:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:06,169 INFO L225 Difference]: With dead ends: 21436 [2024-11-06 19:57:06,169 INFO L226 Difference]: Without dead ends: 12064 [2024-11-06 19:57:06,176 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-06 19:57:06,177 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 377 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:06,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:57:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12064 states. [2024-11-06 19:57:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12064 to 12064. [2024-11-06 19:57:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 12063 states have (on average 1.1321396004310702) internal successors, (13657), 12063 states have internal predecessors, (13657), 0 states have call successors, (0), 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-06 19:57:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 13657 transitions. [2024-11-06 19:57:06,287 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 13657 transitions. Word has length 502 [2024-11-06 19:57:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:06,288 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 13657 transitions. [2024-11-06 19:57:06,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-06 19:57:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 13657 transitions. [2024-11-06 19:57:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-11-06 19:57:06,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:06,295 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:57:06,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -425052023, now seen corresponding path program 1 times [2024-11-06 19:57:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263246778] [2024-11-06 19:57:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-06 19:57:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:06,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263246778] [2024-11-06 19:57:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263246778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:06,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143552557] [2024-11-06 19:57:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:06,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:06,722 INFO L87 Difference]: Start difference. First operand 12064 states and 13657 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-06 19:57:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:07,984 INFO L93 Difference]: Finished difference Result 28625 states and 32702 transitions. [2024-11-06 19:57:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 526 [2024-11-06 19:57:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:08,007 INFO L225 Difference]: With dead ends: 28625 [2024-11-06 19:57:08,007 INFO L226 Difference]: Without dead ends: 16862 [2024-11-06 19:57:08,021 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-06 19:57:08,022 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:08,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:57:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16862 states. [2024-11-06 19:57:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16862 to 15954. [2024-11-06 19:57:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15954 states, 15953 states have (on average 1.1254309534256879) internal successors, (17954), 15953 states have internal predecessors, (17954), 0 states have call successors, (0), 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-06 19:57:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15954 states to 15954 states and 17954 transitions. [2024-11-06 19:57:08,261 INFO L78 Accepts]: Start accepts. Automaton has 15954 states and 17954 transitions. Word has length 526 [2024-11-06 19:57:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:08,262 INFO L471 AbstractCegarLoop]: Abstraction has 15954 states and 17954 transitions. [2024-11-06 19:57:08,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-06 19:57:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15954 states and 17954 transitions. [2024-11-06 19:57:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-11-06 19:57:08,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:08,271 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:08,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:57:08,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:08,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -765323433, now seen corresponding path program 1 times [2024-11-06 19:57:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856190145] [2024-11-06 19:57:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-06 19:57:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856190145] [2024-11-06 19:57:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856190145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253198207] [2024-11-06 19:57:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:08,943 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-06 19:57:08,945 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-06 19:57:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:09,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:57:09,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-06 19:57:10,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:57:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-06 19:57:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253198207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:57:10,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:57:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-06 19:57:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706498313] [2024-11-06 19:57:10,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:57:10,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:57:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:57:10,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:57:10,747 INFO L87 Difference]: Start difference. First operand 15954 states and 17954 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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-06 19:57:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:14,856 INFO L93 Difference]: Finished difference Result 40238 states and 45011 transitions. [2024-11-06 19:57:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 19:57:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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 593 [2024-11-06 19:57:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:14,877 INFO L225 Difference]: With dead ends: 40238 [2024-11-06 19:57:14,877 INFO L226 Difference]: Without dead ends: 17747 [2024-11-06 19:57:14,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1195 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-06 19:57:14,891 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3767 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3767 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 5160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:14,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3767 Valid, 194 Invalid, 5160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:57:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2024-11-06 19:57:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 12661. [2024-11-06 19:57:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.068562401263823) internal successors, (13528), 12660 states have internal predecessors, (13528), 0 states have call successors, (0), 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-06 19:57:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13528 transitions. [2024-11-06 19:57:15,034 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13528 transitions. Word has length 593 [2024-11-06 19:57:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:15,034 INFO L471 AbstractCegarLoop]: Abstraction has 12661 states and 13528 transitions. [2024-11-06 19:57:15,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 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-06 19:57:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13528 transitions. [2024-11-06 19:57:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-11-06 19:57:15,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:15,040 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:15,058 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-06 19:57:15,244 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,SelfDestructingSolverStorable12 [2024-11-06 19:57:15,245 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1468964440, now seen corresponding path program 1 times [2024-11-06 19:57:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966447641] [2024-11-06 19:57:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-06 19:57:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966447641] [2024-11-06 19:57:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966447641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:15,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:15,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378756132] [2024-11-06 19:57:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:15,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:15,521 INFO L87 Difference]: Start difference. First operand 12661 states and 13528 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-06 19:57:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:16,327 INFO L93 Difference]: Finished difference Result 25318 states and 27064 transitions. [2024-11-06 19:57:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:16,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 618 [2024-11-06 19:57:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:16,336 INFO L225 Difference]: With dead ends: 25318 [2024-11-06 19:57:16,336 INFO L226 Difference]: Without dead ends: 12958 [2024-11-06 19:57:16,343 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-06 19:57:16,343 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:16,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:57:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2024-11-06 19:57:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2024-11-06 19:57:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0684152314741666) internal successors, (13524), 12658 states have internal predecessors, (13524), 0 states have call successors, (0), 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-06 19:57:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13524 transitions. [2024-11-06 19:57:16,464 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13524 transitions. Word has length 618 [2024-11-06 19:57:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:16,465 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13524 transitions. [2024-11-06 19:57:16,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-06 19:57:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13524 transitions. [2024-11-06 19:57:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-11-06 19:57:16,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:16,472 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:16,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:57:16,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1825899448, now seen corresponding path program 1 times [2024-11-06 19:57:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:16,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006364147] [2024-11-06 19:57:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 19:57:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:16,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006364147] [2024-11-06 19:57:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006364147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236142188] [2024-11-06 19:57:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:16,753 INFO L87 Difference]: Start difference. First operand 12659 states and 13524 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-06 19:57:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:17,668 INFO L93 Difference]: Finished difference Result 29201 states and 31263 transitions. [2024-11-06 19:57:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 639 [2024-11-06 19:57:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:17,683 INFO L225 Difference]: With dead ends: 29201 [2024-11-06 19:57:17,684 INFO L226 Difference]: Without dead ends: 16544 [2024-11-06 19:57:17,691 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-06 19:57:17,692 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 277 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:17,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 544 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2024-11-06 19:57:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 15647. [2024-11-06 19:57:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15647 states, 15646 states have (on average 1.056755720311901) internal successors, (16534), 15646 states have internal predecessors, (16534), 0 states have call successors, (0), 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-06 19:57:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 16534 transitions. [2024-11-06 19:57:17,845 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 16534 transitions. Word has length 639 [2024-11-06 19:57:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 15647 states and 16534 transitions. [2024-11-06 19:57:17,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-06 19:57:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 16534 transitions. [2024-11-06 19:57:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-06 19:57:17,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:17,853 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:17,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:57:17,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1577308930, now seen corresponding path program 1 times [2024-11-06 19:57:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699712267] [2024-11-06 19:57:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-06 19:57:18,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:18,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699712267] [2024-11-06 19:57:18,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699712267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:18,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:18,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523328501] [2024-11-06 19:57:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:18,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:18,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:18,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:18,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:18,198 INFO L87 Difference]: Start difference. First operand 15647 states and 16534 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-06 19:57:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:19,001 INFO L93 Difference]: Finished difference Result 33980 states and 35967 transitions. [2024-11-06 19:57:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:19,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 663 [2024-11-06 19:57:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:19,017 INFO L225 Difference]: With dead ends: 33980 [2024-11-06 19:57:19,017 INFO L226 Difference]: Without dead ends: 18335 [2024-11-06 19:57:19,027 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-06 19:57:19,028 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 303 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:19,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 169 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:57:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18335 states. [2024-11-06 19:57:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18335 to 17736. [2024-11-06 19:57:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17736 states, 17735 states have (on average 1.0518748237947562) internal successors, (18655), 17735 states have internal predecessors, (18655), 0 states have call successors, (0), 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-06 19:57:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 18655 transitions. [2024-11-06 19:57:19,175 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 18655 transitions. Word has length 663 [2024-11-06 19:57:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:19,175 INFO L471 AbstractCegarLoop]: Abstraction has 17736 states and 18655 transitions. [2024-11-06 19:57:19,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-06 19:57:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 18655 transitions. [2024-11-06 19:57:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-06 19:57:19,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:19,181 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:19,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:57:19,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:19,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1280580184, now seen corresponding path program 1 times [2024-11-06 19:57:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:19,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233649400] [2024-11-06 19:57:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 72 proven. 386 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-06 19:57:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233649400] [2024-11-06 19:57:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233649400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605312454] [2024-11-06 19:57:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:20,322 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-06 19:57:20,324 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-06 19:57:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:20,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:20,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-06 19:57:20,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605312454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:20,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-06 19:57:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274963099] [2024-11-06 19:57:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:20,624 INFO L87 Difference]: Start difference. First operand 17736 states and 18655 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-06 19:57:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:21,421 INFO L93 Difference]: Finished difference Result 35163 states and 36991 transitions. [2024-11-06 19:57:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 663 [2024-11-06 19:57:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:21,441 INFO L225 Difference]: With dead ends: 35163 [2024-11-06 19:57:21,441 INFO L226 Difference]: Without dead ends: 17429 [2024-11-06 19:57:21,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:21,453 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 289 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:21,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 497 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:57:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17429 states. [2024-11-06 19:57:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17429 to 16830. [2024-11-06 19:57:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16830 states, 16829 states have (on average 1.0295917761007785) internal successors, (17327), 16829 states have internal predecessors, (17327), 0 states have call successors, (0), 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-06 19:57:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16830 states to 16830 states and 17327 transitions. [2024-11-06 19:57:21,573 INFO L78 Accepts]: Start accepts. Automaton has 16830 states and 17327 transitions. Word has length 663 [2024-11-06 19:57:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:21,574 INFO L471 AbstractCegarLoop]: Abstraction has 16830 states and 17327 transitions. [2024-11-06 19:57:21,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-06 19:57:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 16830 states and 17327 transitions. [2024-11-06 19:57:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-11-06 19:57:21,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:21,581 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:21,596 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-06 19:57:21,782 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-06 19:57:21,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1236683574, now seen corresponding path program 1 times [2024-11-06 19:57:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:21,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984233795] [2024-11-06 19:57:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 551 proven. 190 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-06 19:57:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984233795] [2024-11-06 19:57:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984233795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193689478] [2024-11-06 19:57:22,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:22,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:22,425 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-06 19:57:22,427 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-06 19:57:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:22,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:22,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-06 19:57:22,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193689478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:57:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751065789] [2024-11-06 19:57:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:22,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:22,969 INFO L87 Difference]: Start difference. First operand 16830 states and 17327 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-06 19:57:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:23,958 INFO L93 Difference]: Finished difference Result 39658 states and 40848 transitions. [2024-11-06 19:57:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:23,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 670 [2024-11-06 19:57:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:23,975 INFO L225 Difference]: With dead ends: 39658 [2024-11-06 19:57:23,976 INFO L226 Difference]: Without dead ends: 22830 [2024-11-06 19:57:23,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:23,985 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 302 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:23,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 477 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22830 states. [2024-11-06 19:57:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22830 to 20720. [2024-11-06 19:57:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20720 states, 20719 states have (on average 1.0287176022008784) internal successors, (21314), 20719 states have internal predecessors, (21314), 0 states have call successors, (0), 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-06 19:57:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20720 states to 20720 states and 21314 transitions. [2024-11-06 19:57:24,191 INFO L78 Accepts]: Start accepts. Automaton has 20720 states and 21314 transitions. Word has length 670 [2024-11-06 19:57:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:24,191 INFO L471 AbstractCegarLoop]: Abstraction has 20720 states and 21314 transitions. [2024-11-06 19:57:24,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-06 19:57:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20720 states and 21314 transitions. [2024-11-06 19:57:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2024-11-06 19:57:24,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:24,200 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:24,212 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-06 19:57:24,401 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-06 19:57:24,401 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1001583289, now seen corresponding path program 1 times [2024-11-06 19:57:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:24,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997457811] [2024-11-06 19:57:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1202 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-06 19:57:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997457811] [2024-11-06 19:57:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997457811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:24,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269051436] [2024-11-06 19:57:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:24,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:24,690 INFO L87 Difference]: Start difference. First operand 20720 states and 21314 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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-06 19:57:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:25,406 INFO L93 Difference]: Finished difference Result 33017 states and 33949 transitions. [2024-11-06 19:57:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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 758 [2024-11-06 19:57:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:25,417 INFO L225 Difference]: With dead ends: 33017 [2024-11-06 19:57:25,417 INFO L226 Difference]: Without dead ends: 12598 [2024-11-06 19:57:25,425 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-06 19:57:25,425 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 190 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:25,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 367 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:57:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12598 states. [2024-11-06 19:57:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12598 to 11701. [2024-11-06 19:57:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11701 states, 11700 states have (on average 1.0217948717948717) internal successors, (11955), 11700 states have internal predecessors, (11955), 0 states have call successors, (0), 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-06 19:57:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11701 states to 11701 states and 11955 transitions. [2024-11-06 19:57:25,506 INFO L78 Accepts]: Start accepts. Automaton has 11701 states and 11955 transitions. Word has length 758 [2024-11-06 19:57:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:25,506 INFO L471 AbstractCegarLoop]: Abstraction has 11701 states and 11955 transitions. [2024-11-06 19:57:25,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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-06 19:57:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 11701 states and 11955 transitions. [2024-11-06 19:57:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2024-11-06 19:57:25,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:25,514 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:57:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 19:57:25,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1219416639, now seen corresponding path program 1 times [2024-11-06 19:57:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553048860] [2024-11-06 19:57:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-06 19:57:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:26,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553048860] [2024-11-06 19:57:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553048860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:26,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637204297] [2024-11-06 19:57:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:26,071 INFO L87 Difference]: Start difference. First operand 11701 states and 11955 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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-06 19:57:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:26,718 INFO L93 Difference]: Finished difference Result 24604 states and 25133 transitions. [2024-11-06 19:57:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 801 [2024-11-06 19:57:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:26,729 INFO L225 Difference]: With dead ends: 24604 [2024-11-06 19:57:26,729 INFO L226 Difference]: Without dead ends: 13204 [2024-11-06 19:57:26,734 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-06 19:57:26,735 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:26,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 111 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13204 states. [2024-11-06 19:57:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13204 to 11402. [2024-11-06 19:57:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11402 states, 11401 states have (on average 1.0204368037891414) internal successors, (11634), 11401 states have internal predecessors, (11634), 0 states have call successors, (0), 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-06 19:57:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11402 states to 11402 states and 11634 transitions. [2024-11-06 19:57:26,811 INFO L78 Accepts]: Start accepts. Automaton has 11402 states and 11634 transitions. Word has length 801 [2024-11-06 19:57:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:26,811 INFO L471 AbstractCegarLoop]: Abstraction has 11402 states and 11634 transitions. [2024-11-06 19:57:26,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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-06 19:57:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11402 states and 11634 transitions. [2024-11-06 19:57:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2024-11-06 19:57:26,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:26,820 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 19:57:26,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1971664397, now seen corresponding path program 1 times [2024-11-06 19:57:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:26,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381953765] [2024-11-06 19:57:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-06 19:57:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381953765] [2024-11-06 19:57:27,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381953765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:27,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:27,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702466383] [2024-11-06 19:57:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:27,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:27,125 INFO L87 Difference]: Start difference. First operand 11402 states and 11634 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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-06 19:57:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:27,776 INFO L93 Difference]: Finished difference Result 23997 states and 24489 transitions. [2024-11-06 19:57:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 880 [2024-11-06 19:57:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:27,791 INFO L225 Difference]: With dead ends: 23997 [2024-11-06 19:57:27,791 INFO L226 Difference]: Without dead ends: 12896 [2024-11-06 19:57:27,800 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-06 19:57:27,801 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:27,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12896 states. [2024-11-06 19:57:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12896 to 10803. [2024-11-06 19:57:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10803 states, 10802 states have (on average 1.016756156267358) internal successors, (10983), 10802 states have internal predecessors, (10983), 0 states have call successors, (0), 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-06 19:57:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 10983 transitions. [2024-11-06 19:57:27,876 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 10983 transitions. Word has length 880 [2024-11-06 19:57:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:27,876 INFO L471 AbstractCegarLoop]: Abstraction has 10803 states and 10983 transitions. [2024-11-06 19:57:27,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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-06 19:57:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 10983 transitions. [2024-11-06 19:57:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-06 19:57:27,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:27,884 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 19:57:27,885 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:27,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 352462084, now seen corresponding path program 1 times [2024-11-06 19:57:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784555447] [2024-11-06 19:57:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-06 19:57:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784555447] [2024-11-06 19:57:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784555447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832237407] [2024-11-06 19:57:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:28,480 INFO L87 Difference]: Start difference. First operand 10803 states and 10983 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 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-06 19:57:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:29,141 INFO L93 Difference]: Finished difference Result 23105 states and 23494 transitions. [2024-11-06 19:57:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 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) Word has length 893 [2024-11-06 19:57:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:29,153 INFO L225 Difference]: With dead ends: 23105 [2024-11-06 19:57:29,153 INFO L226 Difference]: Without dead ends: 12603 [2024-11-06 19:57:29,158 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-06 19:57:29,160 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:29,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 74 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12603 states. [2024-11-06 19:57:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12603 to 9904. [2024-11-06 19:57:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9904 states, 9903 states have (on average 1.0163586791881247) internal successors, (10065), 9903 states have internal predecessors, (10065), 0 states have call successors, (0), 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-06 19:57:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 10065 transitions. [2024-11-06 19:57:29,223 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 10065 transitions. Word has length 893 [2024-11-06 19:57:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:29,223 INFO L471 AbstractCegarLoop]: Abstraction has 9904 states and 10065 transitions. [2024-11-06 19:57:29,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 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-06 19:57:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 10065 transitions. [2024-11-06 19:57:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2024-11-06 19:57:29,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:29,231 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:29,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 19:57:29,231 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 773802516, now seen corresponding path program 1 times [2024-11-06 19:57:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632992933] [2024-11-06 19:57:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2024-11-06 19:57:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632992933] [2024-11-06 19:57:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632992933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516895534] [2024-11-06 19:57:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:29,606 INFO L87 Difference]: Start difference. First operand 9904 states and 10065 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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-06 19:57:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:30,198 INFO L93 Difference]: Finished difference Result 20104 states and 20434 transitions. [2024-11-06 19:57:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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 964 [2024-11-06 19:57:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:30,207 INFO L225 Difference]: With dead ends: 20104 [2024-11-06 19:57:30,207 INFO L226 Difference]: Without dead ends: 10501 [2024-11-06 19:57:30,212 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-06 19:57:30,212 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 311 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:30,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 401 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10501 states. [2024-11-06 19:57:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10501 to 9604. [2024-11-06 19:57:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9604 states, 9603 states have (on average 1.0159325210871604) internal successors, (9756), 9603 states have internal predecessors, (9756), 0 states have call successors, (0), 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-06 19:57:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 9756 transitions. [2024-11-06 19:57:30,267 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 9756 transitions. Word has length 964 [2024-11-06 19:57:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 9604 states and 9756 transitions. [2024-11-06 19:57:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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-06 19:57:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 9756 transitions. [2024-11-06 19:57:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2024-11-06 19:57:30,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:30,276 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:30,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 19:57:30,276 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:30,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash -329798691, now seen corresponding path program 1 times [2024-11-06 19:57:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:30,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147570328] [2024-11-06 19:57:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 143 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2024-11-06 19:57:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147570328] [2024-11-06 19:57:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147570328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002379415] [2024-11-06 19:57:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:31,021 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-06 19:57:31,022 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-06 19:57:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:31,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 19:57:31,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 143 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2024-11-06 19:57:35,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:57:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 143 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2024-11-06 19:57:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002379415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:57:37,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:57:37,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-06 19:57:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255939111] [2024-11-06 19:57:37,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:57:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 19:57:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 19:57:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:57:37,007 INFO L87 Difference]: Start difference. First operand 9604 states and 9756 transitions. Second operand has 10 states, 10 states have (on average 146.2) internal successors, (1462), 9 states have internal predecessors, (1462), 0 states have call successors, (0), 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-06 19:57:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:40,944 INFO L93 Difference]: Finished difference Result 18601 states and 18906 transitions. [2024-11-06 19:57:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 19:57:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 146.2) internal successors, (1462), 9 states have internal predecessors, (1462), 0 states have call successors, (0), 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 1066 [2024-11-06 19:57:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:40,958 INFO L225 Difference]: With dead ends: 18601 [2024-11-06 19:57:40,958 INFO L226 Difference]: Without dead ends: 18599 [2024-11-06 19:57:40,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2134 GetRequests, 2126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:57:40,960 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1110 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 158 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:40,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 116 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 3237 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:57:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18599 states. [2024-11-06 19:57:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18599 to 9305. [2024-11-06 19:57:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9305 states, 9304 states have (on average 1.015799656061909) internal successors, (9451), 9304 states have internal predecessors, (9451), 0 states have call successors, (0), 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-06 19:57:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 9451 transitions. [2024-11-06 19:57:41,046 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 9451 transitions. Word has length 1066 [2024-11-06 19:57:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:41,047 INFO L471 AbstractCegarLoop]: Abstraction has 9305 states and 9451 transitions. [2024-11-06 19:57:41,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.2) internal successors, (1462), 9 states have internal predecessors, (1462), 0 states have call successors, (0), 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-06 19:57:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 9451 transitions. [2024-11-06 19:57:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2024-11-06 19:57:41,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:41,057 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:41,069 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-06 19:57:41,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-06 19:57:41,257 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash -321067316, now seen corresponding path program 1 times [2024-11-06 19:57:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922070387] [2024-11-06 19:57:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 1107 proven. 188 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2024-11-06 19:57:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922070387] [2024-11-06 19:57:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922070387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850603252] [2024-11-06 19:57:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:42,494 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-06 19:57:42,494 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-06 19:57:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:42,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:42,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2024-11-06 19:57:42,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850603252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:57:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152681346] [2024-11-06 19:57:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:42,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:42,884 INFO L87 Difference]: Start difference. First operand 9305 states and 9451 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-06 19:57:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:43,565 INFO L93 Difference]: Finished difference Result 20404 states and 20727 transitions. [2024-11-06 19:57:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 1110 [2024-11-06 19:57:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:43,567 INFO L225 Difference]: With dead ends: 20404 [2024-11-06 19:57:43,567 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:57:43,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:43,573 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 287 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:43,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 358 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:57:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:57:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-06 19:57:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:57:43,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2024-11-06 19:57:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:57:43,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-06 19:57:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:57:43,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:57:43,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:57:43,593 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-06 19:57:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-06 19:57:43,780 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-06 19:57:43,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:57:48,445 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:57:48,465 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 19:57:48,480 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 19:57:48,483 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 19:57:48,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:57:48 BoogieIcfgContainer [2024-11-06 19:57:48,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:57:48,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:57:48,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:57:48,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:57:48,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:44" (3/4) ... [2024-11-06 19:57:48,498 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:57:48,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:57:48,533 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:57:48,535 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:57:48,537 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:57:48,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:57:48,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:57:48,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:57:48,731 INFO L158 Benchmark]: Toolchain (without parser) took 68419.67ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 71.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 361.2MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,731 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:57:48,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 894.60ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 60.3MB in the end (delta: 11.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 219.60ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 42.3MB in the end (delta: 18.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,734 INFO L158 Benchmark]: Boogie Preprocessor took 382.31ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 42.3MB in the beginning and 119.8MB in the end (delta: -77.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,734 INFO L158 Benchmark]: RCFGBuilder took 2638.14ms. Allocated memory is still 201.3MB. Free memory was 119.8MB in the beginning and 76.8MB in the end (delta: 43.0MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,734 INFO L158 Benchmark]: TraceAbstraction took 64040.59ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 76.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 994.8MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,735 INFO L158 Benchmark]: Witness Printer took 234.87ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:57:48,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 894.60ms. Allocated memory is still 100.7MB. Free memory was 71.7MB in the beginning and 60.3MB in the end (delta: 11.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 219.60ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 42.3MB in the end (delta: 18.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 382.31ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 42.3MB in the beginning and 119.8MB in the end (delta: -77.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2638.14ms. Allocated memory is still 201.3MB. Free memory was 119.8MB in the beginning and 76.8MB in the end (delta: 43.0MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * TraceAbstraction took 64040.59ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 76.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 994.8MB. Max. memory is 16.1GB. * Witness Printer took 234.87ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 131]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.3s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 10989 SdHoareTripleChecker+Valid, 32.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10989 mSDsluCounter, 8822 SdHoareTripleChecker+Invalid, 27.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 921 mSDsCounter, 4104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27895 IncrementalHoareTripleChecker+Invalid, 32000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4104 mSolverCounterUnsat, 7901 mSDtfsCounter, 27895 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5837 GetRequests, 5782 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20720occurred in iteration=18, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 31813 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 17924 NumberOfCodeBlocks, 17924 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 19551 ConstructedInterpolants, 304 QuantifiedInterpolants, 71730 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4803 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 20870/24022 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1)) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (0 <= ((long long) 97 + a0))) && (((long long) 42 + a4) <= 0)) && (((long long) a29 + 18) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (((long long) a29 + 18) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600214 + a0)))) || (((((((a29 <= 41) && (0 <= ((long long) a29 + 14))) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= (4831 + ((((long long) 9 * a0) >= 0) ? (((long long) 9 * a0) / 10) : ((((long long) 9 * a0) / 10) - 1)))))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= (4831 + ((((long long) 9 * a0) >= 0) ? (((long long) 9 * a0) / 10) : ((((long long) 9 * a0) / 10) - 1)))))) || ((((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600214 + a0)))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600214 + a0)))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (((long long) a29 + 127) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600214 + a0)))) || ((((a29 <= 41) && (0 <= ((long long) a29 + 15))) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600214 + a0))) && (a2 == 4))) || (((a29 <= 41) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600214 + a0)))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 4))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a29 + 401505) <= 0))) || (((((a29 <= 41) && (((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1)))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a29 + 15))) && (0 <= ((long long) 600214 + a0)))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (((long long) a29 + 18) <= 0)) && (a2 == 1))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (((long long) a29 + 18) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((44 <= a29) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((0 <= ((long long) a29 + 14)) && (((long long) 89 + a4) <= 0)) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:57:48,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE