./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label50.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/Problem17_label50.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', '451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105'] 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/Problem17_label50.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 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:08:54,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:08:54,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:08:54,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:08:54,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:08:54,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:08:54,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:08:54,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:08:54,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:08:54,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:08:54,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:08:54,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:08:54,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:08:54,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:08:54,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:08:54,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:08:54,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:08:54,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:08:54,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:08:54,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:08:54,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:08:54,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:08:54,272 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 -> 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 [2024-11-06 20:08:54,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:08:54,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:08:54,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:08:54,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:08:54,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:08:54,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2024-11-06 20:08:55,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:08:56,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:08:56,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2024-11-06 20:08:56,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a32fd57d6/47e6a3fd6f9b4e049ac697098c0a61da/FLAG63ef61f25 [2024-11-06 20:08:56,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a32fd57d6/47e6a3fd6f9b4e049ac697098c0a61da [2024-11-06 20:08:56,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:08:56,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:08:56,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:08:56,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:08:56,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:08:56,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:56" (1/1) ... [2024-11-06 20:08:56,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498f540c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:56, skipping insertion in model container [2024-11-06 20:08:56,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:56" (1/1) ... [2024-11-06 20:08:56,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:08:56,550 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/Problem17_label50.c[1517,1530] [2024-11-06 20:08:56,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:08:57,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:08:57,022 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/Problem17_label50.c[1517,1530] [2024-11-06 20:08:57,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:08:57,311 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:08:57,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57 WrapperNode [2024-11-06 20:08:57,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:08:57,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:08:57,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:08:57,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:08:57,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:57,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:57,733 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:08:57,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:08:57,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:08:57,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:08:57,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:08:57,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:57,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:57,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,010 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 20:08:58,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:08:58,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:08:58,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:08:58,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:08:58,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (1/1) ... [2024-11-06 20:08:58,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:08:58,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:08:58,362 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 20:08:58,368 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 20:08:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:08:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:08:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:08:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:08:58,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:08:58,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:09:01,830 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:09:01,830 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:09:01,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:09:01,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:09:01,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:09:01 BoogieIcfgContainer [2024-11-06 20:09:01,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:09:01,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:09:01,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:09:01,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:09:01,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:08:56" (1/3) ... [2024-11-06 20:09:01,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66de4787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:09:01, skipping insertion in model container [2024-11-06 20:09:01,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:57" (2/3) ... [2024-11-06 20:09:01,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66de4787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:09:01, skipping insertion in model container [2024-11-06 20:09:01,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:09:01" (3/3) ... [2024-11-06 20:09:01,875 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label50.c [2024-11-06 20:09:01,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:09:01,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:09:01,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:09:01,975 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;@2d2a296c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:09:01,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:09:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 20:09:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-06 20:09:01,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:01,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:01,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 647015545, now seen corresponding path program 1 times [2024-11-06 20:09:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609513497] [2024-11-06 20:09:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:02,185 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 20:09:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609513497] [2024-11-06 20:09:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609513497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:02,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:02,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:02,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520989262] [2024-11-06 20:09:02,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:02,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:02,216 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 20:09:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:04,658 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2024-11-06 20:09:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-06 20:09:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:04,674 INFO L225 Difference]: With dead ends: 1667 [2024-11-06 20:09:04,675 INFO L226 Difference]: Without dead ends: 998 [2024-11-06 20:09:04,678 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 20:09:04,680 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 536 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:04,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 20:09:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-06 20:09:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2024-11-06 20:09:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:09:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2024-11-06 20:09:04,753 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 9 [2024-11-06 20:09:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:04,753 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2024-11-06 20:09:04,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 20:09:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2024-11-06 20:09:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 20:09:04,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:04,756 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 20:09:04,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:09:04,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2030614627, now seen corresponding path program 1 times [2024-11-06 20:09:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915920699] [2024-11-06 20:09:04,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:05,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915920699] [2024-11-06 20:09:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915920699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110819277] [2024-11-06 20:09:05,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:05,078 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 20:09:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:07,020 INFO L93 Difference]: Finished difference Result 2843 states and 4882 transitions. [2024-11-06 20:09:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-06 20:09:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:07,028 INFO L225 Difference]: With dead ends: 2843 [2024-11-06 20:09:07,029 INFO L226 Difference]: Without dead ends: 1863 [2024-11-06 20:09:07,032 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 20:09:07,033 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 409 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:07,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 495 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:09:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-06 20:09:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1857. [2024-11-06 20:09:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4552801724137931) internal successors, (2701), 1856 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states 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 20:09:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2701 transitions. [2024-11-06 20:09:07,109 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2701 transitions. Word has length 74 [2024-11-06 20:09:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:07,110 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2701 transitions. [2024-11-06 20:09:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 20:09:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2701 transitions. [2024-11-06 20:09:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-06 20:09:07,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:07,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:09:07,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash -634340724, now seen corresponding path program 1 times [2024-11-06 20:09:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987066405] [2024-11-06 20:09:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987066405] [2024-11-06 20:09:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987066405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175119164] [2024-11-06 20:09:07,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:07,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:07,305 INFO L87 Difference]: Start difference. First operand 1857 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 20:09:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:09,227 INFO L93 Difference]: Finished difference Result 5425 states and 7895 transitions. [2024-11-06 20:09:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-06 20:09:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:09,241 INFO L225 Difference]: With dead ends: 5425 [2024-11-06 20:09:09,241 INFO L226 Difference]: Without dead ends: 3570 [2024-11-06 20:09:09,243 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 20:09:09,244 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:09,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:09:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2024-11-06 20:09:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2714. [2024-11-06 20:09:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.315886472539624) internal successors, (3570), 2713 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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 20:09:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3570 transitions. [2024-11-06 20:09:09,299 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3570 transitions. Word has length 80 [2024-11-06 20:09:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:09,299 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 3570 transitions. [2024-11-06 20:09:09,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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 20:09:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3570 transitions. [2024-11-06 20:09:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-06 20:09:09,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:09,301 INFO L215 NwaCegarLoop]: trace histogram [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, 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 20:09:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:09:09,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -516869556, now seen corresponding path program 1 times [2024-11-06 20:09:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456487190] [2024-11-06 20:09:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456487190] [2024-11-06 20:09:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456487190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 20:09:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429788097] [2024-11-06 20:09:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:09:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:09,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:09:09,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:09,851 INFO L87 Difference]: Start difference. First operand 2714 states and 3570 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 20:09:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:11,955 INFO L93 Difference]: Finished difference Result 7147 states and 9641 transitions. [2024-11-06 20:09:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-06 20:09:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:11,972 INFO L225 Difference]: With dead ends: 7147 [2024-11-06 20:09:11,972 INFO L226 Difference]: Without dead ends: 4435 [2024-11-06 20:09:11,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:11,979 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 1651 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:11,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 863 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:09:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2024-11-06 20:09:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4424. [2024-11-06 20:09:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 4423 states have (on average 1.2912050644359032) internal successors, (5711), 4423 states have internal predecessors, (5711), 0 states have call successors, (0), 0 states 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 20:09:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 5711 transitions. [2024-11-06 20:09:12,084 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 5711 transitions. Word has length 157 [2024-11-06 20:09:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:12,085 INFO L471 AbstractCegarLoop]: Abstraction has 4424 states and 5711 transitions. [2024-11-06 20:09:12,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 20:09:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 5711 transitions. [2024-11-06 20:09:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-06 20:09:12,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:12,089 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:12,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:09:12,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2127190533, now seen corresponding path program 1 times [2024-11-06 20:09:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:12,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626843079] [2024-11-06 20:09:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:09:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626843079] [2024-11-06 20:09:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626843079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409155177] [2024-11-06 20:09:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:12,354 INFO L87 Difference]: Start difference. First operand 4424 states and 5711 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 20:09:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:14,301 INFO L93 Difference]: Finished difference Result 10593 states and 13804 transitions. [2024-11-06 20:09:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 163 [2024-11-06 20:09:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:14,319 INFO L225 Difference]: With dead ends: 10593 [2024-11-06 20:09:14,319 INFO L226 Difference]: Without dead ends: 6171 [2024-11-06 20:09:14,324 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 20:09:14,326 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 544 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:14,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 240 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:09:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2024-11-06 20:09:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6153. [2024-11-06 20:09:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6152 states have (on average 1.303966189856957) internal successors, (8022), 6152 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states 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 20:09:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8022 transitions. [2024-11-06 20:09:14,446 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8022 transitions. Word has length 163 [2024-11-06 20:09:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:14,446 INFO L471 AbstractCegarLoop]: Abstraction has 6153 states and 8022 transitions. [2024-11-06 20:09:14,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 20:09:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8022 transitions. [2024-11-06 20:09:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-06 20:09:14,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:14,450 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:09:14,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -406876171, now seen corresponding path program 1 times [2024-11-06 20:09:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753634624] [2024-11-06 20:09:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753634624] [2024-11-06 20:09:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753634624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126510023] [2024-11-06 20:09:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:09:14,935 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 20:09:14,937 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 20:09:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:15,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:09:15,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:09:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:15,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:09:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126510023] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:09:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-11-06 20:09:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779663741] [2024-11-06 20:09:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:09:15,778 INFO L87 Difference]: Start difference. First operand 6153 states and 8022 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:09:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:18,599 INFO L93 Difference]: Finished difference Result 19997 states and 26780 transitions. [2024-11-06 20:09:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-06 20:09:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:18,635 INFO L225 Difference]: With dead ends: 19997 [2024-11-06 20:09:18,635 INFO L226 Difference]: Without dead ends: 12537 [2024-11-06 20:09:18,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:09:18,645 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 847 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 823 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 823 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:18,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 168 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [823 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 20:09:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2024-11-06 20:09:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 12531. [2024-11-06 20:09:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12531 states, 12530 states have (on average 1.2289704708699123) internal successors, (15399), 12530 states have internal predecessors, (15399), 0 states have call successors, (0), 0 states 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 20:09:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12531 states to 12531 states and 15399 transitions. [2024-11-06 20:09:18,844 INFO L78 Accepts]: Start accepts. Automaton has 12531 states and 15399 transitions. Word has length 229 [2024-11-06 20:09:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:18,845 INFO L471 AbstractCegarLoop]: Abstraction has 12531 states and 15399 transitions. [2024-11-06 20:09:18,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:09:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12531 states and 15399 transitions. [2024-11-06 20:09:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-06 20:09:18,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:18,853 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:18,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 20:09:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:19,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 805102240, now seen corresponding path program 1 times [2024-11-06 20:09:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302063010] [2024-11-06 20:09:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302063010] [2024-11-06 20:09:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302063010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059694493] [2024-11-06 20:09:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:19,414 INFO L87 Difference]: Start difference. First operand 12531 states and 15399 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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 20:09:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:21,115 INFO L93 Difference]: Finished difference Result 34470 states and 41945 transitions. [2024-11-06 20:09:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2024-11-06 20:09:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:21,160 INFO L225 Difference]: With dead ends: 34470 [2024-11-06 20:09:21,160 INFO L226 Difference]: Without dead ends: 20239 [2024-11-06 20:09:21,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 20:09:21,177 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 301 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:21,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 815 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:09:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20239 states. [2024-11-06 20:09:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20239 to 19801. [2024-11-06 20:09:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19801 states, 19800 states have (on average 1.1657070707070707) internal successors, (23081), 19800 states have internal predecessors, (23081), 0 states have call successors, (0), 0 states 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 20:09:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19801 states to 19801 states and 23081 transitions. [2024-11-06 20:09:21,488 INFO L78 Accepts]: Start accepts. Automaton has 19801 states and 23081 transitions. Word has length 266 [2024-11-06 20:09:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:21,489 INFO L471 AbstractCegarLoop]: Abstraction has 19801 states and 23081 transitions. [2024-11-06 20:09:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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 20:09:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19801 states and 23081 transitions. [2024-11-06 20:09:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-06 20:09:21,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:21,496 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 20:09:21,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:09:21,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:21,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1154149176, now seen corresponding path program 1 times [2024-11-06 20:09:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249533044] [2024-11-06 20:09:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:09:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249533044] [2024-11-06 20:09:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249533044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718074566] [2024-11-06 20:09:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:21,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:21,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:21,766 INFO L87 Difference]: Start difference. First operand 19801 states and 23081 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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 20:09:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:23,411 INFO L93 Difference]: Finished difference Result 43851 states and 51236 transitions. [2024-11-06 20:09:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 348 [2024-11-06 20:09:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:23,469 INFO L225 Difference]: With dead ends: 43851 [2024-11-06 20:09:23,469 INFO L226 Difference]: Without dead ends: 24052 [2024-11-06 20:09:23,490 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 20:09:23,491 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 275 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:23,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 794 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:09:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24052 states. [2024-11-06 20:09:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24052 to 24052. [2024-11-06 20:09:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24052 states, 24051 states have (on average 1.1488919379651574) internal successors, (27632), 24051 states have internal predecessors, (27632), 0 states have call successors, (0), 0 states 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 20:09:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24052 states to 24052 states and 27632 transitions. [2024-11-06 20:09:23,802 INFO L78 Accepts]: Start accepts. Automaton has 24052 states and 27632 transitions. Word has length 348 [2024-11-06 20:09:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:23,803 INFO L471 AbstractCegarLoop]: Abstraction has 24052 states and 27632 transitions. [2024-11-06 20:09:23,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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 20:09:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24052 states and 27632 transitions. [2024-11-06 20:09:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-06 20:09:23,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:23,813 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 20:09:23,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:09:23,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 595362029, now seen corresponding path program 1 times [2024-11-06 20:09:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410702150] [2024-11-06 20:09:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410702150] [2024-11-06 20:09:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410702150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525012719] [2024-11-06 20:09:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:24,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:24,184 INFO L87 Difference]: Start difference. First operand 24052 states and 27632 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 20:09:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:25,903 INFO L93 Difference]: Finished difference Result 60926 states and 70205 transitions. [2024-11-06 20:09:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:25,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 371 [2024-11-06 20:09:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:25,973 INFO L225 Difference]: With dead ends: 60926 [2024-11-06 20:09:25,974 INFO L226 Difference]: Without dead ends: 36876 [2024-11-06 20:09:25,996 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 20:09:25,997 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 334 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:25,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 692 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:09:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36876 states. [2024-11-06 20:09:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36876 to 34716. [2024-11-06 20:09:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34716 states, 34715 states have (on average 1.1565029526141437) internal successors, (40148), 34715 states have internal predecessors, (40148), 0 states have call successors, (0), 0 states 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 20:09:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34716 states to 34716 states and 40148 transitions. [2024-11-06 20:09:26,543 INFO L78 Accepts]: Start accepts. Automaton has 34716 states and 40148 transitions. Word has length 371 [2024-11-06 20:09:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 34716 states and 40148 transitions. [2024-11-06 20:09:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 20:09:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34716 states and 40148 transitions. [2024-11-06 20:09:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-06 20:09:26,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:26,553 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 20:09:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:09:26,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1359032333, now seen corresponding path program 1 times [2024-11-06 20:09:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402837150] [2024-11-06 20:09:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:09:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:26,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402837150] [2024-11-06 20:09:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402837150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:26,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050171957] [2024-11-06 20:09:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:26,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:26,868 INFO L87 Difference]: Start difference. First operand 34716 states and 40148 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:09:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:28,604 INFO L93 Difference]: Finished difference Result 78831 states and 90900 transitions. [2024-11-06 20:09:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:28,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2024-11-06 20:09:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:28,642 INFO L225 Difference]: With dead ends: 78831 [2024-11-06 20:09:28,642 INFO L226 Difference]: Without dead ends: 43692 [2024-11-06 20:09:28,658 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 20:09:28,659 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 517 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:28,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 172 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:09:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43692 states. [2024-11-06 20:09:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43692 to 35139. [2024-11-06 20:09:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35139 states, 35138 states have (on average 1.155102737776766) internal successors, (40588), 35138 states have internal predecessors, (40588), 0 states have call successors, (0), 0 states 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 20:09:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35139 states to 35139 states and 40588 transitions. [2024-11-06 20:09:29,048 INFO L78 Accepts]: Start accepts. Automaton has 35139 states and 40588 transitions. Word has length 372 [2024-11-06 20:09:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:29,048 INFO L471 AbstractCegarLoop]: Abstraction has 35139 states and 40588 transitions. [2024-11-06 20:09:29,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:09:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 35139 states and 40588 transitions. [2024-11-06 20:09:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-06 20:09:29,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:29,058 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:09:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:09:29,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1137848729, now seen corresponding path program 1 times [2024-11-06 20:09:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839705206] [2024-11-06 20:09:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839705206] [2024-11-06 20:09:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839705206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223401156] [2024-11-06 20:09:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:29,785 INFO L87 Difference]: Start difference. First operand 35139 states and 40588 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 20:09:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:31,354 INFO L93 Difference]: Finished difference Result 74975 states and 86935 transitions. [2024-11-06 20:09:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 414 [2024-11-06 20:09:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:31,393 INFO L225 Difference]: With dead ends: 74975 [2024-11-06 20:09:31,393 INFO L226 Difference]: Without dead ends: 39838 [2024-11-06 20:09:31,419 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 20:09:31,420 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 295 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:31,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 796 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:09:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39838 states. [2024-11-06 20:09:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39838 to 39831. [2024-11-06 20:09:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39831 states, 39830 states have (on average 1.1538538789856891) internal successors, (45958), 39830 states have internal predecessors, (45958), 0 states have call successors, (0), 0 states 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 20:09:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39831 states to 39831 states and 45958 transitions. [2024-11-06 20:09:31,851 INFO L78 Accepts]: Start accepts. Automaton has 39831 states and 45958 transitions. Word has length 414 [2024-11-06 20:09:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:31,852 INFO L471 AbstractCegarLoop]: Abstraction has 39831 states and 45958 transitions. [2024-11-06 20:09:31,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 20:09:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39831 states and 45958 transitions. [2024-11-06 20:09:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-11-06 20:09:31,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:31,862 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:09:31,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:09:31,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1337478149, now seen corresponding path program 1 times [2024-11-06 20:09:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65050203] [2024-11-06 20:09:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:32,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65050203] [2024-11-06 20:09:32,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65050203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327099244] [2024-11-06 20:09:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:32,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:32,191 INFO L87 Difference]: Start difference. First operand 39831 states and 45958 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 20:09:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:33,831 INFO L93 Difference]: Finished difference Result 95409 states and 110033 transitions. [2024-11-06 20:09:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 442 [2024-11-06 20:09:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:34,009 INFO L225 Difference]: With dead ends: 95409 [2024-11-06 20:09:34,010 INFO L226 Difference]: Without dead ends: 55579 [2024-11-06 20:09:34,019 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 20:09:34,020 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 292 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:34,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 409 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:09:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55579 states. [2024-11-06 20:09:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55579 to 52589. [2024-11-06 20:09:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52589 states, 52588 states have (on average 1.1394234426104815) internal successors, (59920), 52588 states have internal predecessors, (59920), 0 states have call successors, (0), 0 states 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 20:09:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52589 states to 52589 states and 59920 transitions. [2024-11-06 20:09:34,384 INFO L78 Accepts]: Start accepts. Automaton has 52589 states and 59920 transitions. Word has length 442 [2024-11-06 20:09:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:34,385 INFO L471 AbstractCegarLoop]: Abstraction has 52589 states and 59920 transitions. [2024-11-06 20:09:34,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 20:09:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 52589 states and 59920 transitions. [2024-11-06 20:09:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-06 20:09:34,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:34,400 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:34,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:09:34,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:34,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1777864081, now seen corresponding path program 1 times [2024-11-06 20:09:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726022571] [2024-11-06 20:09:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:09:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726022571] [2024-11-06 20:09:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726022571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:34,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:34,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:34,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876715154] [2024-11-06 20:09:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:34,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:34,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:34,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:34,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:34,851 INFO L87 Difference]: Start difference. First operand 52589 states and 59920 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 20:09:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:36,187 INFO L93 Difference]: Finished difference Result 104740 states and 119344 transitions. [2024-11-06 20:09:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 482 [2024-11-06 20:09:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:36,240 INFO L225 Difference]: With dead ends: 104740 [2024-11-06 20:09:36,240 INFO L226 Difference]: Without dead ends: 52153 [2024-11-06 20:09:36,272 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 20:09:36,273 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 495 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:36,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 724 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:09:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52153 states. [2024-11-06 20:09:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52153 to 51297. [2024-11-06 20:09:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51297 states, 51296 states have (on average 1.103828758577667) internal successors, (56622), 51296 states have internal predecessors, (56622), 0 states have call successors, (0), 0 states 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 20:09:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51297 states to 51297 states and 56622 transitions. [2024-11-06 20:09:36,927 INFO L78 Accepts]: Start accepts. Automaton has 51297 states and 56622 transitions. Word has length 482 [2024-11-06 20:09:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 51297 states and 56622 transitions. [2024-11-06 20:09:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 20:09:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51297 states and 56622 transitions. [2024-11-06 20:09:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-06 20:09:36,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:36,942 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:36,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:09:36,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:36,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash -283806341, now seen corresponding path program 1 times [2024-11-06 20:09:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:36,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012040214] [2024-11-06 20:09:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-06 20:09:37,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012040214] [2024-11-06 20:09:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012040214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091857707] [2024-11-06 20:09:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:37,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:37,430 INFO L87 Difference]: Start difference. First operand 51297 states and 56622 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 20:09:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:39,139 INFO L93 Difference]: Finished difference Result 115798 states and 128215 transitions. [2024-11-06 20:09:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:39,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 483 [2024-11-06 20:09:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:39,205 INFO L225 Difference]: With dead ends: 115798 [2024-11-06 20:09:39,205 INFO L226 Difference]: Without dead ends: 64503 [2024-11-06 20:09:39,235 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 20:09:39,235 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 471 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:39,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 377 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:09:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64503 states. [2024-11-06 20:09:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64503 to 53000. [2024-11-06 20:09:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53000 states, 52999 states have (on average 1.1035679918489028) internal successors, (58488), 52999 states have internal predecessors, (58488), 0 states have call successors, (0), 0 states 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 20:09:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53000 states to 53000 states and 58488 transitions. [2024-11-06 20:09:39,901 INFO L78 Accepts]: Start accepts. Automaton has 53000 states and 58488 transitions. Word has length 483 [2024-11-06 20:09:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:39,901 INFO L471 AbstractCegarLoop]: Abstraction has 53000 states and 58488 transitions. [2024-11-06 20:09:39,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 20:09:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 53000 states and 58488 transitions. [2024-11-06 20:09:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-11-06 20:09:39,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:39,913 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:39,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:09:39,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -983224542, now seen corresponding path program 1 times [2024-11-06 20:09:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:39,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256221988] [2024-11-06 20:09:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:09:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256221988] [2024-11-06 20:09:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256221988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:40,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:40,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818441018] [2024-11-06 20:09:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:40,441 INFO L87 Difference]: Start difference. First operand 53000 states and 58488 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 20:09:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:41,921 INFO L93 Difference]: Finished difference Result 119189 states and 131869 transitions. [2024-11-06 20:09:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:41,922 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 495 [2024-11-06 20:09:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:41,989 INFO L225 Difference]: With dead ends: 119189 [2024-11-06 20:09:41,989 INFO L226 Difference]: Without dead ends: 64489 [2024-11-06 20:09:42,022 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 20:09:42,022 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 279 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:42,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 760 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:09:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64489 states. [2024-11-06 20:09:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64489 to 52530. [2024-11-06 20:09:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52530 states, 52529 states have (on average 1.0992023453711284) internal successors, (57740), 52529 states have internal predecessors, (57740), 0 states have call successors, (0), 0 states 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 20:09:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52530 states to 52530 states and 57740 transitions. [2024-11-06 20:09:42,819 INFO L78 Accepts]: Start accepts. Automaton has 52530 states and 57740 transitions. Word has length 495 [2024-11-06 20:09:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:42,819 INFO L471 AbstractCegarLoop]: Abstraction has 52530 states and 57740 transitions. [2024-11-06 20:09:42,819 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 20:09:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 52530 states and 57740 transitions. [2024-11-06 20:09:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-11-06 20:09:42,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:42,835 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:09:42,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1126737193, now seen corresponding path program 1 times [2024-11-06 20:09:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966709582] [2024-11-06 20:09:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 325 proven. 7 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:09:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966709582] [2024-11-06 20:09:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966709582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257704777] [2024-11-06 20:09:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:43,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:09:43,691 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 20:09:43,692 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 20:09:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:43,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:09:43,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:09:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 20:09:44,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:09:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 20:09:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257704777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:09:45,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:09:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-06 20:09:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204596433] [2024-11-06 20:09:45,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:09:45,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 20:09:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 20:09:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 20:09:45,216 INFO L87 Difference]: Start difference. First operand 52530 states and 57740 transitions. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 20:09:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:57,252 INFO L93 Difference]: Finished difference Result 175755 states and 192674 transitions. [2024-11-06 20:09:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 20:09:57,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 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 498 [2024-11-06 20:09:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:57,384 INFO L225 Difference]: With dead ends: 175755 [2024-11-06 20:09:57,384 INFO L226 Difference]: Without dead ends: 115558 [2024-11-06 20:09:57,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1010 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2024-11-06 20:09:57,436 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 11909 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 13623 mSolverCounterSat, 3280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11909 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 16903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3280 IncrementalHoareTripleChecker+Valid, 13623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:57,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11909 Valid, 422 Invalid, 16903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3280 Valid, 13623 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2024-11-06 20:09:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115558 states. [2024-11-06 20:09:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115558 to 102304. [2024-11-06 20:09:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102304 states, 102303 states have (on average 1.0798608056459733) internal successors, (110473), 102303 states have internal predecessors, (110473), 0 states have call successors, (0), 0 states 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 20:09:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102304 states to 102304 states and 110473 transitions. [2024-11-06 20:09:58,859 INFO L78 Accepts]: Start accepts. Automaton has 102304 states and 110473 transitions. Word has length 498 [2024-11-06 20:09:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:58,859 INFO L471 AbstractCegarLoop]: Abstraction has 102304 states and 110473 transitions. [2024-11-06 20:09:58,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 20:09:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 102304 states and 110473 transitions. [2024-11-06 20:09:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2024-11-06 20:09:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:58,871 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:58,883 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 20:09:59,071 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,SelfDestructingSolverStorable15 [2024-11-06 20:09:59,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1903355248, now seen corresponding path program 1 times [2024-11-06 20:09:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560361768] [2024-11-06 20:09:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-06 20:09:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560361768] [2024-11-06 20:09:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560361768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:59,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:09:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419626214] [2024-11-06 20:09:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:09:59,430 INFO L87 Difference]: Start difference. First operand 102304 states and 110473 transitions. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 20:10:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:10:02,068 INFO L93 Difference]: Finished difference Result 226322 states and 244555 transitions. [2024-11-06 20:10:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:10:02,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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 557 [2024-11-06 20:10:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:10:02,211 INFO L225 Difference]: With dead ends: 226322 [2024-11-06 20:10:02,212 INFO L226 Difference]: Without dead ends: 124870 [2024-11-06 20:10:02,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:10:02,257 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 787 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:10:02,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 259 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:10:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124870 states. [2024-11-06 20:10:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124870 to 112077. [2024-11-06 20:10:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112077 states, 112076 states have (on average 1.0731467932474392) internal successors, (120274), 112076 states have internal predecessors, (120274), 0 states have call successors, (0), 0 states 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 20:10:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112077 states to 112077 states and 120274 transitions. [2024-11-06 20:10:03,842 INFO L78 Accepts]: Start accepts. Automaton has 112077 states and 120274 transitions. Word has length 557 [2024-11-06 20:10:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:10:03,842 INFO L471 AbstractCegarLoop]: Abstraction has 112077 states and 120274 transitions. [2024-11-06 20:10:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 20:10:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 112077 states and 120274 transitions. [2024-11-06 20:10:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-06 20:10:03,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:10:03,854 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:10:03,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:10:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:10:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1178922573, now seen corresponding path program 1 times [2024-11-06 20:10:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:10:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727320536] [2024-11-06 20:10:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:10:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-06 20:10:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:10:04,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727320536] [2024-11-06 20:10:04,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727320536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:10:04,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:10:04,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:10:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278196401] [2024-11-06 20:10:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:10:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:10:04,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:10:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:10:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:10:04,368 INFO L87 Difference]: Start difference. First operand 112077 states and 120274 transitions. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 20:10:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:10:06,688 INFO L93 Difference]: Finished difference Result 236522 states and 253514 transitions. [2024-11-06 20:10:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:10:06,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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 563 [2024-11-06 20:10:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:10:06,814 INFO L225 Difference]: With dead ends: 236522 [2024-11-06 20:10:06,814 INFO L226 Difference]: Without dead ends: 125297 [2024-11-06 20:10:06,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:10:06,874 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 807 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:10:06,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 239 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:10:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125297 states. [2024-11-06 20:10:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125297 to 112079. [2024-11-06 20:10:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112079 states, 112078 states have (on average 1.0726190688627564) internal successors, (120217), 112078 states have internal predecessors, (120217), 0 states have call successors, (0), 0 states 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 20:10:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112079 states to 112079 states and 120217 transitions. [2024-11-06 20:10:08,308 INFO L78 Accepts]: Start accepts. Automaton has 112079 states and 120217 transitions. Word has length 563 [2024-11-06 20:10:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:10:08,308 INFO L471 AbstractCegarLoop]: Abstraction has 112079 states and 120217 transitions. [2024-11-06 20:10:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 20:10:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 112079 states and 120217 transitions. [2024-11-06 20:10:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2024-11-06 20:10:08,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:10:08,323 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 20:10:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:10:08,323 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:10:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:10:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1091037453, now seen corresponding path program 1 times [2024-11-06 20:10:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:10:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703908705] [2024-11-06 20:10:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:10:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-06 20:10:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:10:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703908705] [2024-11-06 20:10:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703908705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:10:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:10:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:10:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027268333] [2024-11-06 20:10:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:10:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:10:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:10:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:10:08,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:10:08,800 INFO L87 Difference]: Start difference. First operand 112079 states and 120217 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 20:10:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:10:10,882 INFO L93 Difference]: Finished difference Result 231834 states and 248212 transitions. [2024-11-06 20:10:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:10:10,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 631 [2024-11-06 20:10:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:10:11,000 INFO L225 Difference]: With dead ends: 231834 [2024-11-06 20:10:11,000 INFO L226 Difference]: Without dead ends: 120607 [2024-11-06 20:10:11,034 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 20:10:11,034 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 334 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:10:11,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 146 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:10:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120607 states. [2024-11-06 20:10:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120607 to 96724. [2024-11-06 20:10:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96724 states, 96723 states have (on average 1.0668403585496729) internal successors, (103188), 96723 states have internal predecessors, (103188), 0 states have call successors, (0), 0 states 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 20:10:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96724 states to 96724 states and 103188 transitions. [2024-11-06 20:10:12,115 INFO L78 Accepts]: Start accepts. Automaton has 96724 states and 103188 transitions. Word has length 631 [2024-11-06 20:10:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:10:12,115 INFO L471 AbstractCegarLoop]: Abstraction has 96724 states and 103188 transitions. [2024-11-06 20:10:12,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 20:10:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 96724 states and 103188 transitions. [2024-11-06 20:10:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-11-06 20:10:12,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:10:12,130 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:12,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:10:12,131 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:10:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:10:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1017374823, now seen corresponding path program 1 times [2024-11-06 20:10:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:10:12,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429620671] [2024-11-06 20:10:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:10:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-11-06 20:10:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:10:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429620671] [2024-11-06 20:10:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429620671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:10:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:10:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:10:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151682085] [2024-11-06 20:10:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:10:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:10:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:10:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:10:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:10:12,671 INFO L87 Difference]: Start difference. First operand 96724 states and 103188 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)