./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem15_label26.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', 'cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label26.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 cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:56:48,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:56:48,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:56:48,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:56:48,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:56:48,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:56:48,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:56:48,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:56:48,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:56:48,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:56:48,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:56:48,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:56:48,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:56:48,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:56:48,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:56:48,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:56:48,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:56:48,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:56:48,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:56:48,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:48,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:56:48,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:56:48,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:56:48,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:56:48,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:56:48,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:56:48,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:56:48,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:56:48,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:56:48,117 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 -> cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 [2024-11-06 19:56:48,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:56:48,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:56:48,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:56:48,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:56:48,327 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:56:48,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2024-11-06 19:56:49,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:56:49,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:56:49,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2024-11-06 19:56:49,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d0e5f2c/5e03747c8a7a454dbe84d133340db842/FLAGd0469ff5f [2024-11-06 19:56:49,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2d0e5f2c/5e03747c8a7a454dbe84d133340db842 [2024-11-06 19:56:49,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:56:49,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:56:49,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:49,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:56:49,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:56:49,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:49" (1/1) ... [2024-11-06 19:56:49,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ff5527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:49, skipping insertion in model container [2024-11-06 19:56:49,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:49" (1/1) ... [2024-11-06 19:56:50,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:56:50,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c[6541,6554] [2024-11-06 19:56:50,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:50,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:56:50,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c[6541,6554] [2024-11-06 19:56:50,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:50,572 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:56:50,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50 WrapperNode [2024-11-06 19:56:50,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:50,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:50,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:56:50,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:56:50,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,769 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:56:50,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:50,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:56:50,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:56:50,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:56:50,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,854 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:56:50,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:50,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:51,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:56:51,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:56:51,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:56:51,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:56:51,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (1/1) ... [2024-11-06 19:56:51,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:56:51,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:56:51,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:56:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:56:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:56:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:56:51,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:56:51,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:56:51,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:56:52,943 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:56:52,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:56:52,958 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:56:52,961 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:56:52,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:52 BoogieIcfgContainer [2024-11-06 19:56:52,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:56:52,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:56:52,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:56:52,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:56:52,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:56:49" (1/3) ... [2024-11-06 19:56:52,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c17384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:52, skipping insertion in model container [2024-11-06 19:56:52,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:50" (2/3) ... [2024-11-06 19:56:52,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c17384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:52, skipping insertion in model container [2024-11-06 19:56:52,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:52" (3/3) ... [2024-11-06 19:56:52,969 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2024-11-06 19:56:52,978 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:56:52,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:56:53,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:56:53,032 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;@72eaf176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:56:53,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:56:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:53,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 19:56:53,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:53,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:53,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2024-11-06 19:56:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010969882] [2024-11-06 19:56:53,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010969882] [2024-11-06 19:56:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010969882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507407504] [2024-11-06 19:56:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:53,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:53,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:53,306 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:54,721 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-06 19:56:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-06 19:56:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:54,731 INFO L225 Difference]: With dead ends: 1154 [2024-11-06 19:56:54,731 INFO L226 Difference]: Without dead ends: 665 [2024-11-06 19:56:54,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:54,736 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 268 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:54,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:56:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-06 19:56:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-06 19:56:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-06 19:56:54,777 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 53 [2024-11-06 19:56:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:54,777 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-06 19:56:54,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-06 19:56:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-06 19:56:54,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:54,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:56:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:56:54,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:54,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1371805199, now seen corresponding path program 1 times [2024-11-06 19:56:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:54,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54950913] [2024-11-06 19:56:54,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:55,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:55,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54950913] [2024-11-06 19:56:55,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54950913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:55,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:55,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:55,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022142942] [2024-11-06 19:56:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:55,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:55,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:55,134 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:56,448 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-06 19:56:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-06 19:56:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:56,452 INFO L225 Difference]: With dead ends: 1624 [2024-11-06 19:56:56,452 INFO L226 Difference]: Without dead ends: 963 [2024-11-06 19:56:56,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:56,454 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:56,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:56:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-06 19:56:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-06 19:56:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-06 19:56:56,476 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 118 [2024-11-06 19:56:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:56,477 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-06 19:56:56,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-06 19:56:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 19:56:56,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:56,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:56:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:56:56,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1380310786, now seen corresponding path program 1 times [2024-11-06 19:56:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:56,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020257723] [2024-11-06 19:56:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020257723] [2024-11-06 19:56:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020257723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150671219] [2024-11-06 19:56:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:56,624 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:57,928 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-06 19:56:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-06 19:56:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:57,933 INFO L225 Difference]: With dead ends: 2229 [2024-11-06 19:56:57,933 INFO L226 Difference]: Without dead ends: 1567 [2024-11-06 19:56:57,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:57,934 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:57,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:56:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-06 19:56:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-06 19:56:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2024-11-06 19:56:57,952 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 123 [2024-11-06 19:56:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:57,952 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2024-11-06 19:56:57,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:56:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2024-11-06 19:56:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-06 19:56:57,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:57,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:56:57,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash 72771962, now seen corresponding path program 1 times [2024-11-06 19:56:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450675749] [2024-11-06 19:56:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450675749] [2024-11-06 19:56:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450675749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860401695] [2024-11-06 19:56:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:58,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:58,195 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:00,648 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2024-11-06 19:57:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2024-11-06 19:57:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:00,657 INFO L225 Difference]: With dead ends: 4668 [2024-11-06 19:57:00,657 INFO L226 Difference]: Without dead ends: 3404 [2024-11-06 19:57:00,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:57:00,661 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 484 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:00,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 377 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:57:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2024-11-06 19:57:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2024-11-06 19:57:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2024-11-06 19:57:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 219 [2024-11-06 19:57:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2024-11-06 19:57:00,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2024-11-06 19:57:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-06 19:57:00,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:00,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:00,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:57:00,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:00,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 907724420, now seen corresponding path program 1 times [2024-11-06 19:57:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:00,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488532657] [2024-11-06 19:57:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:57:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488532657] [2024-11-06 19:57:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488532657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:57:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603691436] [2024-11-06 19:57:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:00,871 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:01,855 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2024-11-06 19:57:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-11-06 19:57:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:01,865 INFO L225 Difference]: With dead ends: 8563 [2024-11-06 19:57:01,866 INFO L226 Difference]: Without dead ends: 5483 [2024-11-06 19:57:01,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:01,869 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:01,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-06 19:57:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-06 19:57:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2024-11-06 19:57:01,929 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 223 [2024-11-06 19:57:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2024-11-06 19:57:01,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2024-11-06 19:57:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-06 19:57:01,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:01,933 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:01,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:57:01,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2143639772, now seen corresponding path program 1 times [2024-11-06 19:57:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35132020] [2024-11-06 19:57:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 19:57:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:02,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35132020] [2024-11-06 19:57:02,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35132020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:02,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:02,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:57:02,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089481067] [2024-11-06 19:57:02,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:02,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:02,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:02,436 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:03,372 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2024-11-06 19:57:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:03,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-11-06 19:57:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:03,383 INFO L225 Difference]: With dead ends: 10655 [2024-11-06 19:57:03,383 INFO L226 Difference]: Without dead ends: 5478 [2024-11-06 19:57:03,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:03,388 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:03,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-06 19:57:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-06 19:57:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2024-11-06 19:57:03,444 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 325 [2024-11-06 19:57:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:03,445 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2024-11-06 19:57:03,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2024-11-06 19:57:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-06 19:57:03,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:03,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:03,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:57:03,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:03,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 350088141, now seen corresponding path program 1 times [2024-11-06 19:57:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620966088] [2024-11-06 19:57:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:57:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620966088] [2024-11-06 19:57:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620966088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069858399] [2024-11-06 19:57:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:03,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:03,651 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:04,711 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2024-11-06 19:57:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 340 [2024-11-06 19:57:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:04,723 INFO L225 Difference]: With dead ends: 11851 [2024-11-06 19:57:04,723 INFO L226 Difference]: Without dead ends: 6674 [2024-11-06 19:57:04,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:04,725 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 262 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:04,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-06 19:57:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2024-11-06 19:57:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2024-11-06 19:57:04,770 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 340 [2024-11-06 19:57:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:04,771 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2024-11-06 19:57:04,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2024-11-06 19:57:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-06 19:57:04,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:04,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:57:04,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -683428854, now seen corresponding path program 1 times [2024-11-06 19:57:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963270507] [2024-11-06 19:57:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:57:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963270507] [2024-11-06 19:57:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963270507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16353658] [2024-11-06 19:57:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:05,054 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:06,222 INFO L93 Difference]: Finished difference Result 10955 states and 13233 transitions. [2024-11-06 19:57:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 399 [2024-11-06 19:57:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:06,243 INFO L225 Difference]: With dead ends: 10955 [2024-11-06 19:57:06,245 INFO L226 Difference]: Without dead ends: 6679 [2024-11-06 19:57:06,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:06,250 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 275 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:06,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:57:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-11-06 19:57:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6081. [2024-11-06 19:57:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 1.1572368421052632) internal successors, (7036), 6080 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 7036 transitions. [2024-11-06 19:57:06,311 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 7036 transitions. Word has length 399 [2024-11-06 19:57:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 6081 states and 7036 transitions. [2024-11-06 19:57:06,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 7036 transitions. [2024-11-06 19:57:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-06 19:57:06,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:06,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:57:06,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2069851958, now seen corresponding path program 1 times [2024-11-06 19:57:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714391906] [2024-11-06 19:57:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:57:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714391906] [2024-11-06 19:57:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714391906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979665747] [2024-11-06 19:57:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:06,546 INFO L87 Difference]: Start difference. First operand 6081 states and 7036 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:07,483 INFO L93 Difference]: Finished difference Result 13965 states and 16476 transitions. [2024-11-06 19:57:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 405 [2024-11-06 19:57:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:07,494 INFO L225 Difference]: With dead ends: 13965 [2024-11-06 19:57:07,494 INFO L226 Difference]: Without dead ends: 8185 [2024-11-06 19:57:07,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:07,498 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 250 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:07,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 601 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2024-11-06 19:57:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7883. [2024-11-06 19:57:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7883 states, 7882 states have (on average 1.1386703882263385) internal successors, (8975), 7882 states have internal predecessors, (8975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7883 states to 7883 states and 8975 transitions. [2024-11-06 19:57:07,566 INFO L78 Accepts]: Start accepts. Automaton has 7883 states and 8975 transitions. Word has length 405 [2024-11-06 19:57:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 7883 states and 8975 transitions. [2024-11-06 19:57:07,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7883 states and 8975 transitions. [2024-11-06 19:57:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-11-06 19:57:07,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:07,569 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:07,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:57:07,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1079722266, now seen corresponding path program 1 times [2024-11-06 19:57:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833065119] [2024-11-06 19:57:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:57:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833065119] [2024-11-06 19:57:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833065119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:07,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:07,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218229406] [2024-11-06 19:57:07,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:07,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:07,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:07,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:07,755 INFO L87 Difference]: Start difference. First operand 7883 states and 8975 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:08,857 INFO L93 Difference]: Finished difference Result 17259 states and 20018 transitions. [2024-11-06 19:57:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 421 [2024-11-06 19:57:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:08,874 INFO L225 Difference]: With dead ends: 17259 [2024-11-06 19:57:08,874 INFO L226 Difference]: Without dead ends: 9677 [2024-11-06 19:57:08,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:08,881 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 245 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:08,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:57:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2024-11-06 19:57:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 9374. [2024-11-06 19:57:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9374 states, 9373 states have (on average 1.1290942067641097) internal successors, (10583), 9373 states have internal predecessors, (10583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9374 states to 9374 states and 10583 transitions. [2024-11-06 19:57:08,946 INFO L78 Accepts]: Start accepts. Automaton has 9374 states and 10583 transitions. Word has length 421 [2024-11-06 19:57:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:08,947 INFO L471 AbstractCegarLoop]: Abstraction has 9374 states and 10583 transitions. [2024-11-06 19:57:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 9374 states and 10583 transitions. [2024-11-06 19:57:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-11-06 19:57:08,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:08,951 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:57:08,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1964586309, now seen corresponding path program 1 times [2024-11-06 19:57:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978915325] [2024-11-06 19:57:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-06 19:57:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978915325] [2024-11-06 19:57:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978915325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112939609] [2024-11-06 19:57:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:09,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:09,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:09,124 INFO L87 Difference]: Start difference. First operand 9374 states and 10583 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 19:57:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:10,184 INFO L93 Difference]: Finished difference Result 20838 states and 23816 transitions. [2024-11-06 19:57:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:10,184 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 517 [2024-11-06 19:57:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:10,200 INFO L225 Difference]: With dead ends: 20838 [2024-11-06 19:57:10,200 INFO L226 Difference]: Without dead ends: 11765 [2024-11-06 19:57:10,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:10,208 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 362 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:10,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2024-11-06 19:57:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 11765. [2024-11-06 19:57:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11765 states, 11764 states have (on average 1.134308058483509) internal successors, (13344), 11764 states have internal predecessors, (13344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11765 states to 11765 states and 13344 transitions. [2024-11-06 19:57:10,340 INFO L78 Accepts]: Start accepts. Automaton has 11765 states and 13344 transitions. Word has length 517 [2024-11-06 19:57:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 11765 states and 13344 transitions. [2024-11-06 19:57:10,341 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 19:57:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11765 states and 13344 transitions. [2024-11-06 19:57:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-11-06 19:57:10,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:10,348 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:57:10,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1159110380, now seen corresponding path program 1 times [2024-11-06 19:57:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531528384] [2024-11-06 19:57:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-06 19:57:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531528384] [2024-11-06 19:57:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531528384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:10,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587422274] [2024-11-06 19:57:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:10,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:10,687 INFO L87 Difference]: Start difference. First operand 11765 states and 13344 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 19:57:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:11,730 INFO L93 Difference]: Finished difference Result 28027 states and 32076 transitions. [2024-11-06 19:57:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:11,731 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 541 [2024-11-06 19:57:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:11,747 INFO L225 Difference]: With dead ends: 28027 [2024-11-06 19:57:11,748 INFO L226 Difference]: Without dead ends: 16563 [2024-11-06 19:57:11,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:11,758 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:11,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 619 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16563 states. [2024-11-06 19:57:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16563 to 16253. [2024-11-06 19:57:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16253 states, 16252 states have (on average 1.125092296332759) internal successors, (18285), 16252 states have internal predecessors, (18285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16253 states to 16253 states and 18285 transitions. [2024-11-06 19:57:11,901 INFO L78 Accepts]: Start accepts. Automaton has 16253 states and 18285 transitions. Word has length 541 [2024-11-06 19:57:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 16253 states and 18285 transitions. [2024-11-06 19:57:11,901 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 19:57:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16253 states and 18285 transitions. [2024-11-06 19:57:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-11-06 19:57:11,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:11,908 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:57:11,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -973775122, now seen corresponding path program 1 times [2024-11-06 19:57:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853299702] [2024-11-06 19:57:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 153 proven. 317 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-06 19:57:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853299702] [2024-11-06 19:57:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853299702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37595074] [2024-11-06 19:57:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:12,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:12,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:57:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:12,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:12,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-06 19:57:12,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37595074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-06 19:57:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651892353] [2024-11-06 19:57:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:12,845 INFO L87 Difference]: Start difference. First operand 16253 states and 18285 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:14,286 INFO L93 Difference]: Finished difference Result 31902 states and 35928 transitions. [2024-11-06 19:57:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:14,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 595 [2024-11-06 19:57:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:14,302 INFO L225 Difference]: With dead ends: 31902 [2024-11-06 19:57:14,302 INFO L226 Difference]: Without dead ends: 15950 [2024-11-06 19:57:14,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:14,313 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 278 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:14,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 606 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:57:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15950 states. [2024-11-06 19:57:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15950 to 15351. [2024-11-06 19:57:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15351 states, 15350 states have (on average 1.078371335504886) internal successors, (16553), 15350 states have internal predecessors, (16553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15351 states to 15351 states and 16553 transitions. [2024-11-06 19:57:14,421 INFO L78 Accepts]: Start accepts. Automaton has 15351 states and 16553 transitions. Word has length 595 [2024-11-06 19:57:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:14,421 INFO L471 AbstractCegarLoop]: Abstraction has 15351 states and 16553 transitions. [2024-11-06 19:57:14,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15351 states and 16553 transitions. [2024-11-06 19:57:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2024-11-06 19:57:14,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:14,427 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:14,440 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 19:57:14,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 19:57:14,628 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:14,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash 667607770, now seen corresponding path program 1 times [2024-11-06 19:57:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689867721] [2024-11-06 19:57:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-06 19:57:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689867721] [2024-11-06 19:57:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689867721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801907884] [2024-11-06 19:57:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:15,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:15,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:57:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:15,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:57:15,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-06 19:57:15,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:57:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-06 19:57:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801907884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:57:16,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:57:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-06 19:57:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105185880] [2024-11-06 19:57:16,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:57:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:57:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:57:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:57:16,276 INFO L87 Difference]: Start difference. First operand 15351 states and 16553 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:19,944 INFO L93 Difference]: Finished difference Result 39032 states and 42065 transitions. [2024-11-06 19:57:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 19:57:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 608 [2024-11-06 19:57:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:19,960 INFO L225 Difference]: With dead ends: 39032 [2024-11-06 19:57:19,960 INFO L226 Difference]: Without dead ends: 16845 [2024-11-06 19:57:19,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-06 19:57:19,972 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 3099 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4778 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 5472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 4778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:19,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3099 Valid, 203 Invalid, 5472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 4778 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:57:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16845 states. [2024-11-06 19:57:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16845 to 12656. [2024-11-06 19:57:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 12655 states have (on average 1.0378506519162387) internal successors, (13134), 12655 states have internal predecessors, (13134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 13134 transitions. [2024-11-06 19:57:20,085 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 13134 transitions. Word has length 608 [2024-11-06 19:57:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 13134 transitions. [2024-11-06 19:57:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 13134 transitions. [2024-11-06 19:57:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-11-06 19:57:20,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:20,092 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:20,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:57:20,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:20,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 307890966, now seen corresponding path program 1 times [2024-11-06 19:57:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035634025] [2024-11-06 19:57:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-06 19:57:20,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:20,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035634025] [2024-11-06 19:57:20,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035634025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:20,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085877104] [2024-11-06 19:57:20,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:20,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:20,534 INFO L87 Difference]: Start difference. First operand 12656 states and 13134 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:21,234 INFO L93 Difference]: Finished difference Result 27997 states and 29099 transitions. [2024-11-06 19:57:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 678 [2024-11-06 19:57:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:21,246 INFO L225 Difference]: With dead ends: 27997 [2024-11-06 19:57:21,246 INFO L226 Difference]: Without dead ends: 15343 [2024-11-06 19:57:21,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:21,254 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:21,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 192 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2024-11-06 19:57:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14744. [2024-11-06 19:57:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14744 states, 14743 states have (on average 1.033643084853829) internal successors, (15239), 14743 states have internal predecessors, (15239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 15239 transitions. [2024-11-06 19:57:21,353 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 15239 transitions. Word has length 678 [2024-11-06 19:57:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:21,353 INFO L471 AbstractCegarLoop]: Abstraction has 14744 states and 15239 transitions. [2024-11-06 19:57:21,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 15239 transitions. [2024-11-06 19:57:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-11-06 19:57:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:21,358 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:21,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:57:21,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1841661433, now seen corresponding path program 1 times [2024-11-06 19:57:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298717274] [2024-11-06 19:57:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 596 proven. 190 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 19:57:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298717274] [2024-11-06 19:57:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298717274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376703156] [2024-11-06 19:57:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:21,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:21,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:21,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:57:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:22,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:22,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-06 19:57:22,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376703156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:57:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452708596] [2024-11-06 19:57:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:22,326 INFO L87 Difference]: Start difference. First operand 14744 states and 15239 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:23,153 INFO L93 Difference]: Finished difference Result 31296 states and 32405 transitions. [2024-11-06 19:57:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 685 [2024-11-06 19:57:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:23,164 INFO L225 Difference]: With dead ends: 31296 [2024-11-06 19:57:23,164 INFO L226 Difference]: Without dead ends: 16554 [2024-11-06 19:57:23,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:23,172 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 298 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:23,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 128 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16554 states. [2024-11-06 19:57:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16554 to 14444. [2024-11-06 19:57:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.0335802811050336) internal successors, (14928), 14443 states have internal predecessors, (14928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 14928 transitions. [2024-11-06 19:57:23,266 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 14928 transitions. Word has length 685 [2024-11-06 19:57:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:23,266 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 14928 transitions. [2024-11-06 19:57:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 14928 transitions. [2024-11-06 19:57:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2024-11-06 19:57:23,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:23,272 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:23,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 19:57:23,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:23,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:23,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1459953853, now seen corresponding path program 1 times [2024-11-06 19:57:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037913221] [2024-11-06 19:57:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-06 19:57:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:23,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037913221] [2024-11-06 19:57:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037913221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:57:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965119716] [2024-11-06 19:57:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:23,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:23,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:57:23,851 INFO L87 Difference]: Start difference. First operand 14444 states and 14928 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:24,902 INFO L93 Difference]: Finished difference Result 31888 states and 33032 transitions. [2024-11-06 19:57:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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 711 [2024-11-06 19:57:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:24,916 INFO L225 Difference]: With dead ends: 31888 [2024-11-06 19:57:24,916 INFO L226 Difference]: Without dead ends: 17745 [2024-11-06 19:57:24,925 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 19:57:24,925 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 658 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:24,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 441 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17745 states. [2024-11-06 19:57:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17745 to 16848. [2024-11-06 19:57:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16847 states have (on average 1.0306285985635424) internal successors, (17363), 16847 states have internal predecessors, (17363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 17363 transitions. [2024-11-06 19:57:25,033 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 17363 transitions. Word has length 711 [2024-11-06 19:57:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:25,033 INFO L471 AbstractCegarLoop]: Abstraction has 16848 states and 17363 transitions. [2024-11-06 19:57:25,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 17363 transitions. [2024-11-06 19:57:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-11-06 19:57:25,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:25,042 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:57:25,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:25,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash -430298217, now seen corresponding path program 1 times [2024-11-06 19:57:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:25,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450744436] [2024-11-06 19:57:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-06 19:57:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450744436] [2024-11-06 19:57:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450744436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204318748] [2024-11-06 19:57:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:25,310 INFO L87 Difference]: Start difference. First operand 16848 states and 17363 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:25,881 INFO L93 Difference]: Finished difference Result 33692 states and 34726 transitions. [2024-11-06 19:57:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 796 [2024-11-06 19:57:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:25,894 INFO L225 Difference]: With dead ends: 33692 [2024-11-06 19:57:25,894 INFO L226 Difference]: Without dead ends: 17145 [2024-11-06 19:57:25,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:25,902 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:25,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:57:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2024-11-06 19:57:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 16846. [2024-11-06 19:57:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16846 states, 16845 states have (on average 1.0305135054912438) internal successors, (17359), 16845 states have internal predecessors, (17359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16846 states to 16846 states and 17359 transitions. [2024-11-06 19:57:25,998 INFO L78 Accepts]: Start accepts. Automaton has 16846 states and 17359 transitions. Word has length 796 [2024-11-06 19:57:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:25,998 INFO L471 AbstractCegarLoop]: Abstraction has 16846 states and 17359 transitions. [2024-11-06 19:57:25,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16846 states and 17359 transitions. [2024-11-06 19:57:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2024-11-06 19:57:26,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:26,007 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:57:26,008 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:26,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1653832397, now seen corresponding path program 1 times [2024-11-06 19:57:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:26,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088488917] [2024-11-06 19:57:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 802 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-06 19:57:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088488917] [2024-11-06 19:57:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088488917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815202824] [2024-11-06 19:57:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:26,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:26,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 19:57:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:26,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:57:26,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2024-11-06 19:57:27,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815202824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:57:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308840782] [2024-11-06 19:57:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:57:27,854 INFO L87 Difference]: Start difference. First operand 16846 states and 17359 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:28,945 INFO L93 Difference]: Finished difference Result 39687 states and 40957 transitions. [2024-11-06 19:57:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 838 [2024-11-06 19:57:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:28,963 INFO L225 Difference]: With dead ends: 39687 [2024-11-06 19:57:28,963 INFO L226 Difference]: Without dead ends: 23142 [2024-11-06 19:57:28,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:57:28,972 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 303 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:28,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 123 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23142 states. [2024-11-06 19:57:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23142 to 19541. [2024-11-06 19:57:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19541 states, 19540 states have (on average 1.028300921187308) internal successors, (20093), 19540 states have internal predecessors, (20093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 20093 transitions. [2024-11-06 19:57:29,102 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 20093 transitions. Word has length 838 [2024-11-06 19:57:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:29,102 INFO L471 AbstractCegarLoop]: Abstraction has 19541 states and 20093 transitions. [2024-11-06 19:57:29,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 20093 transitions. [2024-11-06 19:57:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2024-11-06 19:57:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:29,116 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:29,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 19:57:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:29,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:29,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1782811620, now seen corresponding path program 1 times [2024-11-06 19:57:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884407949] [2024-11-06 19:57:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-06 19:57:29,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884407949] [2024-11-06 19:57:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884407949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:29,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:29,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:57:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446280923] [2024-11-06 19:57:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:29,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:29,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:29,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:57:29,707 INFO L87 Difference]: Start difference. First operand 19541 states and 20093 transitions. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:30,715 INFO L93 Difference]: Finished difference Result 42672 states and 43896 transitions. [2024-11-06 19:57:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 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 920 [2024-11-06 19:57:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:30,732 INFO L225 Difference]: With dead ends: 42672 [2024-11-06 19:57:30,733 INFO L226 Difference]: Without dead ends: 23733 [2024-11-06 19:57:30,739 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 19:57:30,739 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 521 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:30,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 134 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23733 states. [2024-11-06 19:57:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23733 to 18941. [2024-11-06 19:57:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18941 states, 18940 states have (on average 1.028194297782471) internal successors, (19474), 18940 states have internal predecessors, (19474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18941 states to 18941 states and 19474 transitions. [2024-11-06 19:57:30,892 INFO L78 Accepts]: Start accepts. Automaton has 18941 states and 19474 transitions. Word has length 920 [2024-11-06 19:57:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:30,892 INFO L471 AbstractCegarLoop]: Abstraction has 18941 states and 19474 transitions. [2024-11-06 19:57:30,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18941 states and 19474 transitions. [2024-11-06 19:57:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2024-11-06 19:57:30,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:30,904 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:57:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 19:57:30,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -196750209, now seen corresponding path program 1 times [2024-11-06 19:57:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873378091] [2024-11-06 19:57:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-06 19:57:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873378091] [2024-11-06 19:57:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873378091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409304674] [2024-11-06 19:57:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:31,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:31,288 INFO L87 Difference]: Start difference. First operand 18941 states and 19474 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:31,982 INFO L93 Difference]: Finished difference Result 38471 states and 39655 transitions. [2024-11-06 19:57:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 925 [2024-11-06 19:57:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:31,999 INFO L225 Difference]: With dead ends: 38471 [2024-11-06 19:57:32,000 INFO L226 Difference]: Without dead ends: 22227 [2024-11-06 19:57:32,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:32,011 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 312 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:32,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 503 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:57:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22227 states. [2024-11-06 19:57:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22227 to 20433. [2024-11-06 19:57:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20433 states, 20432 states have (on average 1.0269185591229444) internal successors, (20982), 20432 states have internal predecessors, (20982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 20982 transitions. [2024-11-06 19:57:32,231 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 20982 transitions. Word has length 925 [2024-11-06 19:57:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 20433 states and 20982 transitions. [2024-11-06 19:57:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 20982 transitions. [2024-11-06 19:57:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2024-11-06 19:57:32,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:32,246 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:32,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 19:57:32,246 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:32,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 753461135, now seen corresponding path program 1 times [2024-11-06 19:57:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814640648] [2024-11-06 19:57:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1370 proven. 51 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-06 19:57:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814640648] [2024-11-06 19:57:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814640648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273250791] [2024-11-06 19:57:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:33,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:33,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 19:57:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:33,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 19:57:33,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1520 proven. 266 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-06 19:57:34,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:57:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2024-11-06 19:57:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273250791] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:57:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2024-11-06 19:57:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734259224] [2024-11-06 19:57:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:34,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:57:34,928 INFO L87 Difference]: Start difference. First operand 20433 states and 20982 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:35,548 INFO L93 Difference]: Finished difference Result 33039 states and 33931 transitions. [2024-11-06 19:57:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:35,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 1077 [2024-11-06 19:57:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:35,564 INFO L225 Difference]: With dead ends: 33039 [2024-11-06 19:57:35,564 INFO L226 Difference]: Without dead ends: 15004 [2024-11-06 19:57:35,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2157 GetRequests, 2151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:57:35,575 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 193 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:35,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 359 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:57:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2024-11-06 19:57:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 14107. [2024-11-06 19:57:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 1.0194952502481214) internal successors, (14381), 14106 states have internal predecessors, (14381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 14381 transitions. [2024-11-06 19:57:35,697 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 14381 transitions. Word has length 1077 [2024-11-06 19:57:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:35,697 INFO L471 AbstractCegarLoop]: Abstraction has 14107 states and 14381 transitions. [2024-11-06 19:57:35,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 14381 transitions. [2024-11-06 19:57:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2024-11-06 19:57:35,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:35,708 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:35,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 19:57:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-06 19:57:35,909 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:35,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -930646812, now seen corresponding path program 1 times [2024-11-06 19:57:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175620426] [2024-11-06 19:57:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 1272 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-06 19:57:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175620426] [2024-11-06 19:57:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175620426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:36,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:57:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928522598] [2024-11-06 19:57:36,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:36,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:57:36,637 INFO L87 Difference]: Start difference. First operand 14107 states and 14381 transitions. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:37,513 INFO L93 Difference]: Finished difference Result 22806 states and 23250 transitions. [2024-11-06 19:57:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 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 1089 [2024-11-06 19:57:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:37,530 INFO L225 Difference]: With dead ends: 22806 [2024-11-06 19:57:37,530 INFO L226 Difference]: Without dead ends: 22804 [2024-11-06 19:57:37,534 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 19:57:37,535 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 369 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:37,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 76 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22804 states. [2024-11-06 19:57:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22804 to 15307. [2024-11-06 19:57:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15307 states, 15306 states have (on average 1.0195348229452503) internal successors, (15605), 15306 states have internal predecessors, (15605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15307 states to 15307 states and 15605 transitions. [2024-11-06 19:57:37,646 INFO L78 Accepts]: Start accepts. Automaton has 15307 states and 15605 transitions. Word has length 1089 [2024-11-06 19:57:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:37,646 INFO L471 AbstractCegarLoop]: Abstraction has 15307 states and 15605 transitions. [2024-11-06 19:57:37,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15307 states and 15605 transitions. [2024-11-06 19:57:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2024-11-06 19:57:37,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:37,659 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:37,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 19:57:37,659 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 375105591, now seen corresponding path program 1 times [2024-11-06 19:57:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706365475] [2024-11-06 19:57:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 254 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2024-11-06 19:57:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706365475] [2024-11-06 19:57:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706365475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113399932] [2024-11-06 19:57:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:38,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:38,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 19:57:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:38,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:57:38,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 1439 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-11-06 19:57:38,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:38,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113399932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:38,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:38,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:57:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713352071] [2024-11-06 19:57:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:38,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:38,972 INFO L87 Difference]: Start difference. First operand 15307 states and 15605 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:39,576 INFO L93 Difference]: Finished difference Result 32105 states and 32742 transitions. [2024-11-06 19:57:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 1185 [2024-11-06 19:57:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:39,590 INFO L225 Difference]: With dead ends: 32105 [2024-11-06 19:57:39,590 INFO L226 Difference]: Without dead ends: 19497 [2024-11-06 19:57:39,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:39,597 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 197 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:39,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 369 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:57:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2024-11-06 19:57:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 15900. [2024-11-06 19:57:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15900 states, 15899 states have (on average 1.0184917290395623) internal successors, (16193), 15899 states have internal predecessors, (16193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 16193 transitions. [2024-11-06 19:57:39,702 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 16193 transitions. Word has length 1185 [2024-11-06 19:57:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:39,702 INFO L471 AbstractCegarLoop]: Abstraction has 15900 states and 16193 transitions. [2024-11-06 19:57:39,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 16193 transitions. [2024-11-06 19:57:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2024-11-06 19:57:39,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:39,715 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:39,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 19:57:39,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-06 19:57:39,915 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1690605621, now seen corresponding path program 1 times [2024-11-06 19:57:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082910501] [2024-11-06 19:57:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 1135 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2024-11-06 19:57:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082910501] [2024-11-06 19:57:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082910501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:40,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 19:57:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447803046] [2024-11-06 19:57:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:40,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 19:57:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 19:57:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:40,788 INFO L87 Difference]: Start difference. First operand 15900 states and 16193 transitions. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:42,003 INFO L93 Difference]: Finished difference Result 30895 states and 31478 transitions. [2024-11-06 19:57:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 19:57:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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 1213 [2024-11-06 19:57:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:42,015 INFO L225 Difference]: With dead ends: 30895 [2024-11-06 19:57:42,015 INFO L226 Difference]: Without dead ends: 17694 [2024-11-06 19:57:42,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:57:42,022 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 428 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:42,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 555 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:57:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2024-11-06 19:57:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 15296. [2024-11-06 19:57:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15296 states, 15295 states have (on average 1.0177182085648906) internal successors, (15566), 15295 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15296 states to 15296 states and 15566 transitions. [2024-11-06 19:57:42,127 INFO L78 Accepts]: Start accepts. Automaton has 15296 states and 15566 transitions. Word has length 1213 [2024-11-06 19:57:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:42,127 INFO L471 AbstractCegarLoop]: Abstraction has 15296 states and 15566 transitions. [2024-11-06 19:57:42,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15296 states and 15566 transitions. [2024-11-06 19:57:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2024-11-06 19:57:42,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:42,143 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:42,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-06 19:57:42,144 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:42,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 454535124, now seen corresponding path program 1 times [2024-11-06 19:57:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:42,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770370546] [2024-11-06 19:57:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2372 proven. 409 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-11-06 19:57:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:44,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770370546] [2024-11-06 19:57:44,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770370546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:44,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058245333] [2024-11-06 19:57:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:44,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:44,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 19:57:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:44,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 19:57:44,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2481 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2024-11-06 19:57:44,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058245333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:44,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:57:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86926545] [2024-11-06 19:57:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:44,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:44,806 INFO L87 Difference]: Start difference. First operand 15296 states and 15566 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:45,339 INFO L93 Difference]: Finished difference Result 29993 states and 30525 transitions. [2024-11-06 19:57:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1493 [2024-11-06 19:57:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:45,352 INFO L225 Difference]: With dead ends: 29993 [2024-11-06 19:57:45,352 INFO L226 Difference]: Without dead ends: 17394 [2024-11-06 19:57:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1497 GetRequests, 1494 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:45,358 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 195 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 426 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:57:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17394 states. [2024-11-06 19:57:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17394 to 16494. [2024-11-06 19:57:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16494 states, 16493 states have (on average 1.0170981628569695) internal successors, (16775), 16493 states have internal predecessors, (16775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16494 states to 16494 states and 16775 transitions. [2024-11-06 19:57:45,457 INFO L78 Accepts]: Start accepts. Automaton has 16494 states and 16775 transitions. Word has length 1493 [2024-11-06 19:57:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:45,458 INFO L471 AbstractCegarLoop]: Abstraction has 16494 states and 16775 transitions. [2024-11-06 19:57:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 16494 states and 16775 transitions. [2024-11-06 19:57:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2024-11-06 19:57:45,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:45,474 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:45,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 19:57:45,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:45,675 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1974741072, now seen corresponding path program 1 times [2024-11-06 19:57:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067752815] [2024-11-06 19:57:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 2622 proven. 460 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2024-11-06 19:57:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067752815] [2024-11-06 19:57:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067752815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298897410] [2024-11-06 19:57:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:47,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:47,761 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:57:47,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 19:57:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:48,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 19:57:48,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 1571 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2024-11-06 19:57:50,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298897410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-06 19:57:50,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859538706] [2024-11-06 19:57:50,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:50,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:50,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:57:50,661 INFO L87 Difference]: Start difference. First operand 16494 states and 16775 transitions. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:56,298 INFO L93 Difference]: Finished difference Result 23690 states and 24084 transitions. [2024-11-06 19:57:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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 1495 [2024-11-06 19:57:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:56,299 INFO L225 Difference]: With dead ends: 23690 [2024-11-06 19:57:56,299 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:57:56,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1494 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:57:56,307 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 76 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:56,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 71 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1382 Invalid, 7 Unknown, 0 Unchecked, 5.6s Time] [2024-11-06 19:57:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:57:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:57:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:56,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:57:56,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1495 [2024-11-06 19:57:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:56,308 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:57:56,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:57:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:57:56,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:57:56,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:57:56,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 19:57:56,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-06 19:57:56,514 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:56,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:58:02,589 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 526 DAG size of output: 666 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-06 19:58:05,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:58:05,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 19:58:05,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 19:58:05,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:58:05 BoogieIcfgContainer [2024-11-06 19:58:05,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:58:05,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:58:05,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:58:05,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:58:05,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:52" (3/4) ... [2024-11-06 19:58:05,719 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:58:05,738 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:58:05,740 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:58:05,741 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:58:05,742 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:58:05,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:58:05,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:58:05,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:58:05,879 INFO L158 Benchmark]: Toolchain (without parser) took 75911.28ms. Allocated memory was 117.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 86.9MB in the beginning and 999.5MB in the end (delta: -912.6MB). Peak memory consumption was 920.7MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,879 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:58:05,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.83ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 56.6MB in the end (delta: 30.1MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 195.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 56.6MB in the beginning and 91.7MB in the end (delta: -35.1MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,880 INFO L158 Benchmark]: Boogie Preprocessor took 233.21ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 3.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,880 INFO L158 Benchmark]: RCFGBuilder took 1957.91ms. Allocated memory was 151.0MB in the beginning and 302.0MB in the end (delta: 151.0MB). Free memory was 87.8MB in the beginning and 147.8MB in the end (delta: -60.0MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,880 INFO L158 Benchmark]: TraceAbstraction took 72753.04ms. Allocated memory was 302.0MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 147.0MB in the beginning and 1.0GB in the end (delta: -877.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-06 19:58:05,880 INFO L158 Benchmark]: Witness Printer took 161.11ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 999.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:58:05,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.83ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 56.6MB in the end (delta: 30.1MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 195.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 56.6MB in the beginning and 91.7MB in the end (delta: -35.1MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 233.21ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 3.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1957.91ms. Allocated memory was 151.0MB in the beginning and 302.0MB in the end (delta: 151.0MB). Free memory was 87.8MB in the beginning and 147.8MB in the end (delta: -60.0MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. * TraceAbstraction took 72753.04ms. Allocated memory was 302.0MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 147.0MB in the beginning and 1.0GB in the end (delta: -877.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 161.11ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 999.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 176]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.5s, OverallIterations: 27, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 11182 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11182 mSDsluCounter, 9612 SdHoareTripleChecker+Invalid, 29.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1196 mSDsCounter, 4437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32819 IncrementalHoareTripleChecker+Invalid, 37263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4437 mSolverCounterUnsat, 8416 mSDtfsCounter, 32819 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9754 GetRequests, 9683 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20433occurred in iteration=21, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 38110 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 25968 NumberOfCodeBlocks, 25968 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 27616 ConstructedInterpolants, 661 QuantifiedInterpolants, 88878 SizeOfPredicates, 6 NumberOfNonLiveVariables, 9304 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 43713/46682 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= ((long long) 97 + a0)) && (2 == a2)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a29 <= 42)) && (a2 == 4))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((0 <= ((long long) a29 + 15)) && (((long long) 89 + a4) <= 0)) && (a29 <= 42)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a2 == 4)) && (((long long) a29 + 127) <= 0))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 42)) || (((a2 == 1) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (a29 <= 42))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) == 0)) && (((long long) 44 + a0) == 0))) || (((((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0)) && (a29 <= 42)) && (5 <= a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || ((((0 <= ((long long) a0 + 459337)) && (((long long) 42 + a4) <= 0)) && ((((0 <= ((long long) a4 + 85)) && (a2 == 1)) && (a29 <= 42)) || (((a2 == 1) && (a29 <= 42)) && (((long long) a0 + 61) <= 0)))) && ((((long long) a0 + 300075) == 0) || (((long long) a0 + 300075) < 0)))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a29 <= 42)) && (5 <= a2))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) && (a29 <= 42)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 15))) && (((long long) a0 + 147) <= 0))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 386992) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 15))) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:58:05,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE