./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label05.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_label05.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', '63eefb43987dda8e1668da6021cabb64b22b4f62f3f84321ab9d4efedc35c362'] 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_label05.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 63eefb43987dda8e1668da6021cabb64b22b4f62f3f84321ab9d4efedc35c362 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:55:06,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:55:06,479 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:55:06,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:55:06,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:55:06,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:55:06,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:55:06,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:55:06,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:55:06,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:55:06,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:55:06,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:55:06,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:55:06,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:55:06,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:55:06,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:55:06,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:55:06,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:55:06,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:55:06,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:55:06,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:55:06,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:55:06,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:55:06,517 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 -> 63eefb43987dda8e1668da6021cabb64b22b4f62f3f84321ab9d4efedc35c362 [2024-11-06 19:55:06,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:55:06,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:55:06,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:55:06,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:55:06,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:55:06,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label05.c [2024-11-06 19:55:08,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:55:08,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:55:08,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label05.c [2024-11-06 19:55:08,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d1d49948/b4c3a765cbbd48d5a8ccbb97a958eced/FLAG68f5101ad [2024-11-06 19:55:08,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d1d49948/b4c3a765cbbd48d5a8ccbb97a958eced [2024-11-06 19:55:08,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:55:08,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:55:08,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:55:08,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:55:08,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:55:08,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:08" (1/1) ... [2024-11-06 19:55:08,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29af4d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:08, skipping insertion in model container [2024-11-06 19:55:08,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:08" (1/1) ... [2024-11-06 19:55:08,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:55:08,769 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_label05.c[7777,7790] [2024-11-06 19:55:09,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:55:09,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:55:09,110 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_label05.c[7777,7790] [2024-11-06 19:55:09,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:55:09,296 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:55:09,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09 WrapperNode [2024-11-06 19:55:09,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:55:09,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:55:09,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:55:09,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:55:09,303 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:55:09" (1/1) ... [2024-11-06 19:55:09,349 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:55:09" (1/1) ... [2024-11-06 19:55:09,544 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:55:09,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:55:09,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:55:09,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:55:09,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:55:09,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,729 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:55:09,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:55:09,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:55:09,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:55:09,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:55:09,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (1/1) ... [2024-11-06 19:55:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:55:09,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:09,969 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:55:09,972 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:55:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:55:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:55:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:55:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:55:10,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:55:10,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:55:12,662 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:55:12,665 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:55:12,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:55:12,698 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:55:12,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:12 BoogieIcfgContainer [2024-11-06 19:55:12,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:55:12,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:55:12,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:55:12,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:55:12,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:08" (1/3) ... [2024-11-06 19:55:12,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b40be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:12, skipping insertion in model container [2024-11-06 19:55:12,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:09" (2/3) ... [2024-11-06 19:55:12,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b40be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:12, skipping insertion in model container [2024-11-06 19:55:12,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:12" (3/3) ... [2024-11-06 19:55:12,709 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label05.c [2024-11-06 19:55:12,723 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:55:12,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:55:12,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:55:12,800 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;@4cae9945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:55:12,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:55:12,806 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:55:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 19:55:12,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:12,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:12,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2024-11-06 19:55:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358165557] [2024-11-06 19:55:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:13,237 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:55:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:13,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358165557] [2024-11-06 19:55:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358165557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:13,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:13,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029808412] [2024-11-06 19:55:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:13,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:13,272 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 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:55:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:15,057 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2024-11-06 19:55:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:15,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-06 19:55:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:15,069 INFO L225 Difference]: With dead ends: 1155 [2024-11-06 19:55:15,069 INFO L226 Difference]: Without dead ends: 667 [2024-11-06 19:55:15,075 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:55:15,078 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 280 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:15,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 19:55:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-06 19:55:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2024-11-06 19:55:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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:55:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2024-11-06 19:55:15,139 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 64 [2024-11-06 19:55:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:15,140 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2024-11-06 19:55:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:55:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2024-11-06 19:55:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-06 19:55:15,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:15,146 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, 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] [2024-11-06 19:55:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:55:15,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1499116755, now seen corresponding path program 1 times [2024-11-06 19:55:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822479994] [2024-11-06 19:55:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822479994] [2024-11-06 19:55:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822479994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146076202] [2024-11-06 19:55:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:15,480 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:55:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:16,994 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2024-11-06 19:55:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-06 19:55:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:17,002 INFO L225 Difference]: With dead ends: 1953 [2024-11-06 19:55:17,002 INFO L226 Difference]: Without dead ends: 1290 [2024-11-06 19:55:17,006 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:55:17,008 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:17,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 326 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 19:55:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-11-06 19:55:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2024-11-06 19:55:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3981264637002342) internal successors, (1791), 1281 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states 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:55:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1791 transitions. [2024-11-06 19:55:17,062 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1791 transitions. Word has length 139 [2024-11-06 19:55:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1791 transitions. [2024-11-06 19:55:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:55:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1791 transitions. [2024-11-06 19:55:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-06 19:55:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:17,072 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, 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] [2024-11-06 19:55:17,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:55:17,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:17,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1491517981, now seen corresponding path program 1 times [2024-11-06 19:55:17,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580075282] [2024-11-06 19:55:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580075282] [2024-11-06 19:55:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580075282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192947490] [2024-11-06 19:55:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:17,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:17,272 INFO L87 Difference]: Start difference. First operand 1282 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:55:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:19,111 INFO L93 Difference]: Finished difference Result 3764 states and 5260 transitions. [2024-11-06 19:55:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-11-06 19:55:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:19,123 INFO L225 Difference]: With dead ends: 3764 [2024-11-06 19:55:19,123 INFO L226 Difference]: Without dead ends: 2484 [2024-11-06 19:55:19,125 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:55:19,130 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:19,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 19:55:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2024-11-06 19:55:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2024-11-06 19:55:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2810637322329206) internal successors, (2794), 2181 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states 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:55:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2794 transitions. [2024-11-06 19:55:19,176 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2794 transitions. Word has length 143 [2024-11-06 19:55:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:19,177 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2794 transitions. [2024-11-06 19:55:19,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:55:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2794 transitions. [2024-11-06 19:55:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-06 19:55:19,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:19,183 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:19,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:55:19,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 190346487, now seen corresponding path program 1 times [2024-11-06 19:55:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666258871] [2024-11-06 19:55:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:55:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666258871] [2024-11-06 19:55:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666258871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35071179] [2024-11-06 19:55:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:19,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:19,582 INFO L87 Difference]: Start difference. First operand 2182 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:20,933 INFO L93 Difference]: Finished difference Result 6166 states and 7958 transitions. [2024-11-06 19:55:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-11-06 19:55:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:20,949 INFO L225 Difference]: With dead ends: 6166 [2024-11-06 19:55:20,949 INFO L226 Difference]: Without dead ends: 3986 [2024-11-06 19:55:20,952 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:55:20,954 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:20,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-06 19:55:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2024-11-06 19:55:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.219505569138821) internal successors, (4489), 3681 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states 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:55:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4489 transitions. [2024-11-06 19:55:21,022 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4489 transitions. Word has length 234 [2024-11-06 19:55:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:21,023 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4489 transitions. [2024-11-06 19:55:21,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4489 transitions. [2024-11-06 19:55:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-06 19:55:21,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:21,029 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:55:21,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1927793021, now seen corresponding path program 1 times [2024-11-06 19:55:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683163969] [2024-11-06 19:55:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 19:55:21,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:21,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683163969] [2024-11-06 19:55:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683163969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886020998] [2024-11-06 19:55:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:21,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:21,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:21,884 INFO L87 Difference]: Start difference. First operand 3682 states and 4489 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:55:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:23,096 INFO L93 Difference]: Finished difference Result 7661 states and 9287 transitions. [2024-11-06 19:55:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:23,097 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 336 [2024-11-06 19:55:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:23,107 INFO L225 Difference]: With dead ends: 7661 [2024-11-06 19:55:23,107 INFO L226 Difference]: Without dead ends: 3981 [2024-11-06 19:55:23,111 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:55:23,113 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:23,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:55:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2024-11-06 19:55:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2024-11-06 19:55:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2045226130653266) internal successors, (4794), 3980 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states 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:55:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4794 transitions. [2024-11-06 19:55:23,176 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4794 transitions. Word has length 336 [2024-11-06 19:55:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:23,177 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4794 transitions. [2024-11-06 19:55:23,177 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:55:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4794 transitions. [2024-11-06 19:55:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-06 19:55:23,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:23,182 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, 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] [2024-11-06 19:55:23,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:55:23,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 319333710, now seen corresponding path program 1 times [2024-11-06 19:55:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:23,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521157258] [2024-11-06 19:55:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:55:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521157258] [2024-11-06 19:55:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521157258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:23,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:23,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136526822] [2024-11-06 19:55:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:23,557 INFO L87 Difference]: Start difference. First operand 3981 states and 4794 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:55:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:25,060 INFO L93 Difference]: Finished difference Result 9465 states and 11668 transitions. [2024-11-06 19:55:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 351 [2024-11-06 19:55:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:25,075 INFO L225 Difference]: With dead ends: 9465 [2024-11-06 19:55:25,075 INFO L226 Difference]: Without dead ends: 5785 [2024-11-06 19:55:25,079 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:55:25,080 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 252 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:25,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:55:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2024-11-06 19:55:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2024-11-06 19:55:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.1672431684538223) internal successors, (6749), 5782 states have internal predecessors, (6749), 0 states have call successors, (0), 0 states 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:55:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6749 transitions. [2024-11-06 19:55:25,165 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6749 transitions. Word has length 351 [2024-11-06 19:55:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:25,167 INFO L471 AbstractCegarLoop]: Abstraction has 5783 states and 6749 transitions. [2024-11-06 19:55:25,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:55:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6749 transitions. [2024-11-06 19:55:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-06 19:55:25,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:25,175 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:55:25,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:25,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash 757007055, now seen corresponding path program 1 times [2024-11-06 19:55:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283397602] [2024-11-06 19:55:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:55:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283397602] [2024-11-06 19:55:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283397602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703425950] [2024-11-06 19:55:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:25,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:25,556 INFO L87 Difference]: Start difference. First operand 5783 states and 6749 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:26,982 INFO L93 Difference]: Finished difference Result 13364 states and 15904 transitions. [2024-11-06 19:55:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-11-06 19:55:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:26,998 INFO L225 Difference]: With dead ends: 13364 [2024-11-06 19:55:26,998 INFO L226 Difference]: Without dead ends: 7882 [2024-11-06 19:55:27,003 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:55:27,004 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 263 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:27,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:55:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2024-11-06 19:55:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2024-11-06 19:55:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148427845667994) internal successors, (8364), 7283 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states 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:55:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8364 transitions. [2024-11-06 19:55:27,118 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8364 transitions. Word has length 410 [2024-11-06 19:55:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:27,119 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8364 transitions. [2024-11-06 19:55:27,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8364 transitions. [2024-11-06 19:55:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 19:55:27,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:27,126 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:55:27,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1919562374, now seen corresponding path program 1 times [2024-11-06 19:55:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354061436] [2024-11-06 19:55:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:27,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354061436] [2024-11-06 19:55:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354061436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192199959] [2024-11-06 19:55:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:27,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:27,644 INFO L87 Difference]: Start difference. First operand 7284 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:55:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:28,959 INFO L93 Difference]: Finished difference Result 16069 states and 18808 transitions. [2024-11-06 19:55:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 427 [2024-11-06 19:55:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:28,980 INFO L225 Difference]: With dead ends: 16069 [2024-11-06 19:55:28,980 INFO L226 Difference]: Without dead ends: 9086 [2024-11-06 19:55:28,984 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:55:28,985 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:28,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:55:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2024-11-06 19:55:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8780. [2024-11-06 19:55:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 8779 states have (on average 1.1346394805786537) internal successors, (9961), 8779 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states 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:55:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 9961 transitions. [2024-11-06 19:55:29,110 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 9961 transitions. Word has length 427 [2024-11-06 19:55:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:29,110 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 9961 transitions. [2024-11-06 19:55:29,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:55:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 9961 transitions. [2024-11-06 19:55:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-06 19:55:29,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:29,115 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, 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] [2024-11-06 19:55:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:55:29,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 273734370, now seen corresponding path program 1 times [2024-11-06 19:55:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961750926] [2024-11-06 19:55:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:55:29,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:29,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961750926] [2024-11-06 19:55:29,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961750926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:29,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151128307] [2024-11-06 19:55:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:29,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:29,503 INFO L87 Difference]: Start difference. First operand 8780 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:30,905 INFO L93 Difference]: Finished difference Result 20847 states and 23789 transitions. [2024-11-06 19:55:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2024-11-06 19:55:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:30,931 INFO L225 Difference]: With dead ends: 20847 [2024-11-06 19:55:30,932 INFO L226 Difference]: Without dead ends: 12368 [2024-11-06 19:55:30,941 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:55:30,942 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 250 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12368 states. [2024-11-06 19:55:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12368 to 7877. [2024-11-06 19:55:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 0 states have call successors, (0), 0 states 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:55:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2024-11-06 19:55:31,079 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 437 [2024-11-06 19:55:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:31,080 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2024-11-06 19:55:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2024-11-06 19:55:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-06 19:55:31,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:31,086 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, 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, 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:55:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:55:31,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash -912359307, now seen corresponding path program 1 times [2024-11-06 19:55:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253416809] [2024-11-06 19:55:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-06 19:55:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:31,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253416809] [2024-11-06 19:55:31,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253416809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:31,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702676480] [2024-11-06 19:55:31,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:31,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:31,511 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:55:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:32,779 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2024-11-06 19:55:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:32,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 528 [2024-11-06 19:55:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:32,802 INFO L225 Difference]: With dead ends: 17844 [2024-11-06 19:55:32,802 INFO L226 Difference]: Without dead ends: 10268 [2024-11-06 19:55:32,810 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:55:32,813 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 351 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 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.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:32,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:55:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2024-11-06 19:55:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2024-11-06 19:55:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states 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:55:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2024-11-06 19:55:32,967 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 528 [2024-11-06 19:55:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:32,968 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2024-11-06 19:55:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:55:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2024-11-06 19:55:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2024-11-06 19:55:32,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:32,974 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, 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, 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:55:32,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:55:32,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash -586812719, now seen corresponding path program 1 times [2024-11-06 19:55:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036680659] [2024-11-06 19:55:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-06 19:55:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:33,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036680659] [2024-11-06 19:55:33,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036680659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:33,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506589046] [2024-11-06 19:55:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:33,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:33,443 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:55:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:34,856 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2024-11-06 19:55:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 552 [2024-11-06 19:55:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:34,876 INFO L225 Difference]: With dead ends: 25033 [2024-11-06 19:55:34,876 INFO L226 Difference]: Without dead ends: 15066 [2024-11-06 19:55:34,885 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:55:34,886 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:34,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2024-11-06 19:55:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 14457. [2024-11-06 19:55:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14457 states, 14456 states have (on average 1.1328859988931932) internal successors, (16377), 14456 states have internal predecessors, (16377), 0 states have call successors, (0), 0 states 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:55:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 16377 transitions. [2024-11-06 19:55:35,051 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 16377 transitions. Word has length 552 [2024-11-06 19:55:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 14457 states and 16377 transitions. [2024-11-06 19:55:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:55:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 16377 transitions. [2024-11-06 19:55:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-11-06 19:55:35,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:35,063 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, 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, 3, 3, 3, 3, 3, 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:55:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:55:35,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:35,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1431152031, now seen corresponding path program 1 times [2024-11-06 19:55:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141576330] [2024-11-06 19:55:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 620 proven. 39 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-06 19:55:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141576330] [2024-11-06 19:55:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141576330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:35,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955027798] [2024-11-06 19:55:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:35,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:35,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:35,755 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:55:35,757 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:55:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:35,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:55:35,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 620 proven. 39 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-06 19:55:37,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:55:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 620 proven. 39 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-06 19:55:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955027798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:55:37,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:55:37,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-06 19:55:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513021633] [2024-11-06 19:55:37,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:55:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:55:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:55:37,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:55:37,798 INFO L87 Difference]: Start difference. First operand 14457 states and 16377 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:55:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:42,265 INFO L93 Difference]: Finished difference Result 37246 states and 41901 transitions. [2024-11-06 19:55:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 19:55:42,265 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 619 [2024-11-06 19:55:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:42,287 INFO L225 Difference]: With dead ends: 37246 [2024-11-06 19:55:42,287 INFO L226 Difference]: Without dead ends: 16850 [2024-11-06 19:55:42,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1233 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:55:42,300 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3519 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4379 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 4379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:42,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3519 Valid, 194 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 4379 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-06 19:55:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2024-11-06 19:55:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 12661. [2024-11-06 19:55:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12661 states, 12660 states have (on average 1.0669826224328594) internal successors, (13508), 12660 states have internal predecessors, (13508), 0 states have call successors, (0), 0 states 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:55:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 13508 transitions. [2024-11-06 19:55:42,446 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 13508 transitions. Word has length 619 [2024-11-06 19:55:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:42,446 INFO L471 AbstractCegarLoop]: Abstraction has 12661 states and 13508 transitions. [2024-11-06 19:55:42,447 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:55:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 13508 transitions. [2024-11-06 19:55:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-11-06 19:55:42,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:42,456 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:42,475 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:55:42,657 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,SelfDestructingSolverStorable11 [2024-11-06 19:55:42,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:42,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2104636576, now seen corresponding path program 1 times [2024-11-06 19:55:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744165388] [2024-11-06 19:55:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-06 19:55:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744165388] [2024-11-06 19:55:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744165388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801694083] [2024-11-06 19:55:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:42,979 INFO L87 Difference]: Start difference. First operand 12661 states and 13508 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:43,774 INFO L93 Difference]: Finished difference Result 25318 states and 27024 transitions. [2024-11-06 19:55:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 644 [2024-11-06 19:55:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:43,788 INFO L225 Difference]: With dead ends: 25318 [2024-11-06 19:55:43,788 INFO L226 Difference]: Without dead ends: 12958 [2024-11-06 19:55:43,794 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:55:43,796 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:43,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:55:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12958 states. [2024-11-06 19:55:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12958 to 12659. [2024-11-06 19:55:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.0668352030336545) internal successors, (13504), 12658 states have internal predecessors, (13504), 0 states have call successors, (0), 0 states 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:55:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 13504 transitions. [2024-11-06 19:55:43,909 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 13504 transitions. Word has length 644 [2024-11-06 19:55:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:43,909 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 13504 transitions. [2024-11-06 19:55:43,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 13504 transitions. [2024-11-06 19:55:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2024-11-06 19:55:43,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:43,918 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:43,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:55:43,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:43,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -332439504, now seen corresponding path program 1 times [2024-11-06 19:55:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393574802] [2024-11-06 19:55:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 19:55:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393574802] [2024-11-06 19:55:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393574802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:44,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335582291] [2024-11-06 19:55:44,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:44,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:44,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:44,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:44,848 INFO L87 Difference]: Start difference. First operand 12659 states and 13504 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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:55:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:45,576 INFO L93 Difference]: Finished difference Result 25322 states and 27013 transitions. [2024-11-06 19:55:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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 665 [2024-11-06 19:55:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:45,592 INFO L225 Difference]: With dead ends: 25322 [2024-11-06 19:55:45,592 INFO L226 Difference]: Without dead ends: 12665 [2024-11-06 19:55:45,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:55:45,602 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 311 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:45,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 140 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:55:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2024-11-06 19:55:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 12061. [2024-11-06 19:55:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12061 states, 12060 states have (on average 1.0539800995024875) internal successors, (12711), 12060 states have internal predecessors, (12711), 0 states have call successors, (0), 0 states 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:55:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12061 states to 12061 states and 12711 transitions. [2024-11-06 19:55:45,715 INFO L78 Accepts]: Start accepts. Automaton has 12061 states and 12711 transitions. Word has length 665 [2024-11-06 19:55:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:45,715 INFO L471 AbstractCegarLoop]: Abstraction has 12061 states and 12711 transitions. [2024-11-06 19:55:45,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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:55:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12061 states and 12711 transitions. [2024-11-06 19:55:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2024-11-06 19:55:45,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:45,766 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:55:45,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:55:45,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:45,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1702599014, now seen corresponding path program 1 times [2024-11-06 19:55:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:45,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515156827] [2024-11-06 19:55:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-06 19:55:46,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515156827] [2024-11-06 19:55:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515156827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736937627] [2024-11-06 19:55:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:46,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:46,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:46,340 INFO L87 Difference]: Start difference. First operand 12061 states and 12711 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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:55:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:47,173 INFO L93 Difference]: Finished difference Result 27107 states and 28621 transitions. [2024-11-06 19:55:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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 689 [2024-11-06 19:55:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:47,186 INFO L225 Difference]: With dead ends: 27107 [2024-11-06 19:55:47,186 INFO L226 Difference]: Without dead ends: 15048 [2024-11-06 19:55:47,195 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:55:47,196 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 272 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:47,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 179 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:55:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2024-11-06 19:55:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 14150. [2024-11-06 19:55:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.048625344547318) internal successors, (14837), 14149 states have internal predecessors, (14837), 0 states have call successors, (0), 0 states 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:55:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14837 transitions. [2024-11-06 19:55:47,364 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14837 transitions. Word has length 689 [2024-11-06 19:55:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14837 transitions. [2024-11-06 19:55:47,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 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:55:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14837 transitions. [2024-11-06 19:55:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2024-11-06 19:55:47,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:47,374 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, 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, 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:55:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:55:47,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash 360982866, now seen corresponding path program 1 times [2024-11-06 19:55:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221117407] [2024-11-06 19:55:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 629 proven. 190 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 19:55:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221117407] [2024-11-06 19:55:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221117407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958276775] [2024-11-06 19:55:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:48,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:48,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:48,271 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:55:48,273 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:55:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:48,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:55:48,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-06 19:55:48,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:55:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958276775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:48,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:55:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-06 19:55:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789613604] [2024-11-06 19:55:48,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:48,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:55:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:55:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:55:48,870 INFO L87 Difference]: Start difference. First operand 14150 states and 14837 transitions. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:49,981 INFO L93 Difference]: Finished difference Result 32788 states and 34451 transitions. [2024-11-06 19:55:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 696 [2024-11-06 19:55:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:50,013 INFO L225 Difference]: With dead ends: 32788 [2024-11-06 19:55:50,014 INFO L226 Difference]: Without dead ends: 18640 [2024-11-06 19:55:50,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:55:50,036 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 188 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:50,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 188 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:55:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18640 states. [2024-11-06 19:55:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18640 to 17740. [2024-11-06 19:55:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17740 states, 17739 states have (on average 1.0467331867636283) internal successors, (18568), 17739 states have internal predecessors, (18568), 0 states have call successors, (0), 0 states 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:55:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17740 states to 17740 states and 18568 transitions. [2024-11-06 19:55:50,254 INFO L78 Accepts]: Start accepts. Automaton has 17740 states and 18568 transitions. Word has length 696 [2024-11-06 19:55:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 17740 states and 18568 transitions. [2024-11-06 19:55:50,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17740 states and 18568 transitions. [2024-11-06 19:55:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2024-11-06 19:55:50,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:50,262 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:55:50,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 19:55:50,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:50,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -965881644, now seen corresponding path program 1 times [2024-11-06 19:55:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:50,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038053000] [2024-11-06 19:55:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-06 19:55:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038053000] [2024-11-06 19:55:50,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038053000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:50,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:50,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:55:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539108749] [2024-11-06 19:55:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:50,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:55:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:55:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:55:50,965 INFO L87 Difference]: Start difference. First operand 17740 states and 18568 transitions. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:52,181 INFO L93 Difference]: Finished difference Result 39970 states and 41886 transitions. [2024-11-06 19:55:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:55:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2024-11-06 19:55:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:52,205 INFO L225 Difference]: With dead ends: 39970 [2024-11-06 19:55:52,205 INFO L226 Difference]: Without dead ends: 22531 [2024-11-06 19:55:52,218 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:55:52,218 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 478 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:52,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 168 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:55:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2024-11-06 19:55:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 17740. [2024-11-06 19:55:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17740 states, 17739 states have (on average 1.0467331867636283) internal successors, (18568), 17739 states have internal predecessors, (18568), 0 states have call successors, (0), 0 states 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:55:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17740 states to 17740 states and 18568 transitions. [2024-11-06 19:55:52,414 INFO L78 Accepts]: Start accepts. Automaton has 17740 states and 18568 transitions. Word has length 733 [2024-11-06 19:55:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:52,415 INFO L471 AbstractCegarLoop]: Abstraction has 17740 states and 18568 transitions. [2024-11-06 19:55:52,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 17740 states and 18568 transitions. [2024-11-06 19:55:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-11-06 19:55:52,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:52,428 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:55:52,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:52,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash 376654277, now seen corresponding path program 1 times [2024-11-06 19:55:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065332020] [2024-11-06 19:55:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-06 19:55:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065332020] [2024-11-06 19:55:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065332020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315592713] [2024-11-06 19:55:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:53,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:53,082 INFO L87 Difference]: Start difference. First operand 17740 states and 18568 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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:55:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:53,944 INFO L93 Difference]: Finished difference Result 38181 states and 40063 transitions. [2024-11-06 19:55:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 760 [2024-11-06 19:55:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:53,962 INFO L225 Difference]: With dead ends: 38181 [2024-11-06 19:55:53,962 INFO L226 Difference]: Without dead ends: 20742 [2024-11-06 19:55:53,972 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:55:53,973 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 173 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:53,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 546 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:55:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2024-11-06 19:55:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20443. [2024-11-06 19:55:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20443 states, 20442 states have (on average 1.0438313276587419) internal successors, (21338), 20442 states have internal predecessors, (21338), 0 states have call successors, (0), 0 states 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:55:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20443 states to 20443 states and 21338 transitions. [2024-11-06 19:55:54,154 INFO L78 Accepts]: Start accepts. Automaton has 20443 states and 21338 transitions. Word has length 760 [2024-11-06 19:55:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 20443 states and 21338 transitions. [2024-11-06 19:55:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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:55:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20443 states and 21338 transitions. [2024-11-06 19:55:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2024-11-06 19:55:54,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:54,164 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:55:54,164 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash -226643698, now seen corresponding path program 1 times [2024-11-06 19:55:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874361544] [2024-11-06 19:55:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2024-11-06 19:55:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874361544] [2024-11-06 19:55:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874361544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418507191] [2024-11-06 19:55:54,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:54,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:54,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:54,786 INFO L87 Difference]: Start difference. First operand 20443 states and 21338 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:55:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:55,701 INFO L93 Difference]: Finished difference Result 43293 states and 45271 transitions. [2024-11-06 19:55:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 773 [2024-11-06 19:55:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:55,721 INFO L225 Difference]: With dead ends: 43293 [2024-11-06 19:55:55,721 INFO L226 Difference]: Without dead ends: 23151 [2024-11-06 19:55:55,732 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:55:55,733 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 350 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:55,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 123 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:55:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23151 states. [2024-11-06 19:55:55,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 20739. [2024-11-06 19:55:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20739 states, 20738 states have (on average 1.046195390105121) internal successors, (21696), 20738 states have internal predecessors, (21696), 0 states have call successors, (0), 0 states 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:55:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20739 states to 20739 states and 21696 transitions. [2024-11-06 19:55:55,917 INFO L78 Accepts]: Start accepts. Automaton has 20739 states and 21696 transitions. Word has length 773 [2024-11-06 19:55:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:55,918 INFO L471 AbstractCegarLoop]: Abstraction has 20739 states and 21696 transitions. [2024-11-06 19:55:55,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:55:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20739 states and 21696 transitions. [2024-11-06 19:55:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2024-11-06 19:55:55,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:55,928 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 19:55:55,928 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:55,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -462299624, now seen corresponding path program 1 times [2024-11-06 19:55:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092679049] [2024-11-06 19:55:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 647 proven. 188 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-06 19:55:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092679049] [2024-11-06 19:55:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092679049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307916162] [2024-11-06 19:55:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:57,088 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:55:57,091 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:55:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:57,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:55:57,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-06 19:55:57,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:55:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307916162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:57,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:55:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-06 19:55:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218303379] [2024-11-06 19:55:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:57,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:55:57,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:55:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:55:57,599 INFO L87 Difference]: Start difference. First operand 20739 states and 21696 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:55:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:58,932 INFO L93 Difference]: Finished difference Result 49572 states and 51911 transitions. [2024-11-06 19:55:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:55:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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 786 [2024-11-06 19:55:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:58,958 INFO L225 Difference]: With dead ends: 49572 [2024-11-06 19:55:58,958 INFO L226 Difference]: Without dead ends: 29134 [2024-11-06 19:55:58,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:55:58,972 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 470 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:58,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 139 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:55:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29134 states. [2024-11-06 19:55:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29134 to 24934. [2024-11-06 19:55:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24934 states, 24933 states have (on average 1.0498937151566197) internal successors, (26177), 24933 states have internal predecessors, (26177), 0 states have call successors, (0), 0 states 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:55:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24934 states to 24934 states and 26177 transitions. [2024-11-06 19:55:59,230 INFO L78 Accepts]: Start accepts. Automaton has 24934 states and 26177 transitions. Word has length 786 [2024-11-06 19:55:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:59,230 INFO L471 AbstractCegarLoop]: Abstraction has 24934 states and 26177 transitions. [2024-11-06 19:55:59,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:55:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 24934 states and 26177 transitions. [2024-11-06 19:55:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-11-06 19:55:59,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:59,241 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 19:55:59,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:59,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:59,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash 89927621, now seen corresponding path program 1 times [2024-11-06 19:55:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:59,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161016659] [2024-11-06 19:55:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2024-11-06 19:55:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:59,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161016659] [2024-11-06 19:55:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161016659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132458987] [2024-11-06 19:55:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:59,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:59,663 INFO L87 Difference]: Start difference. First operand 24934 states and 26177 transitions. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:00,543 INFO L93 Difference]: Finished difference Result 43235 states and 45444 transitions. [2024-11-06 19:56:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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:56:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:00,561 INFO L225 Difference]: With dead ends: 43235 [2024-11-06 19:56:00,561 INFO L226 Difference]: Without dead ends: 18602 [2024-11-06 19:56:00,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:00,575 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 340 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:00,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 361 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:56:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18602 states. [2024-11-06 19:56:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18602 to 16808. [2024-11-06 19:56:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16808 states, 16807 states have (on average 1.0369488903433093) internal successors, (17428), 16807 states have internal predecessors, (17428), 0 states have call successors, (0), 0 states 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:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16808 states to 16808 states and 17428 transitions. [2024-11-06 19:56:00,731 INFO L78 Accepts]: Start accepts. Automaton has 16808 states and 17428 transitions. Word has length 796 [2024-11-06 19:56:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:00,732 INFO L471 AbstractCegarLoop]: Abstraction has 16808 states and 17428 transitions. [2024-11-06 19:56:00,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16808 states and 17428 transitions. [2024-11-06 19:56:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2024-11-06 19:56:00,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:00,743 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 19:56:00,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:00,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1474347218, now seen corresponding path program 1 times [2024-11-06 19:56:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:00,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361094975] [2024-11-06 19:56:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 810 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-06 19:56:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361094975] [2024-11-06 19:56:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361094975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286270239] [2024-11-06 19:56:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:01,157 INFO L87 Difference]: Start difference. First operand 16808 states and 17428 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:01,795 INFO L93 Difference]: Finished difference Result 33908 states and 35105 transitions. [2024-11-06 19:56:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:01,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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 962 [2024-11-06 19:56:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:01,823 INFO L225 Difference]: With dead ends: 33908 [2024-11-06 19:56:01,823 INFO L226 Difference]: Without dead ends: 17102 [2024-11-06 19:56:01,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:01,836 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 308 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:01,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 417 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:56:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17102 states. [2024-11-06 19:56:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17102 to 15007. [2024-11-06 19:56:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15007 states, 15006 states have (on average 1.0330534452885511) internal successors, (15502), 15006 states have internal predecessors, (15502), 0 states have call successors, (0), 0 states 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:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15007 states to 15007 states and 15502 transitions. [2024-11-06 19:56:01,999 INFO L78 Accepts]: Start accepts. Automaton has 15007 states and 15502 transitions. Word has length 962 [2024-11-06 19:56:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:02,000 INFO L471 AbstractCegarLoop]: Abstraction has 15007 states and 15502 transitions. [2024-11-06 19:56:02,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 15007 states and 15502 transitions. [2024-11-06 19:56:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2024-11-06 19:56:02,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:02,013 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:56:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 19:56:02,014 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:02,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash 345029106, now seen corresponding path program 1 times [2024-11-06 19:56:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302519323] [2024-11-06 19:56:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1293 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2024-11-06 19:56:02,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302519323] [2024-11-06 19:56:02,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302519323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:02,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:56:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489561269] [2024-11-06 19:56:02,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:02,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:02,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:02,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:02,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:02,748 INFO L87 Difference]: Start difference. First operand 15007 states and 15502 transitions. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:03,737 INFO L93 Difference]: Finished difference Result 18606 states and 19182 transitions. [2024-11-06 19:56:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 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 1076 [2024-11-06 19:56:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:03,739 INFO L225 Difference]: With dead ends: 18606 [2024-11-06 19:56:03,739 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:56:03,744 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:56:03,745 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 397 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:03,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 59 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:56:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:56:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:56:03,746 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:56:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:56:03,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1076 [2024-11-06 19:56:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:03,746 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:56:03,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:56:03,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:56:03,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:56:03,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 19:56:03,752 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] [2024-11-06 19:56:03,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:56:06,592 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:56:06,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:56:06 BoogieIcfgContainer [2024-11-06 19:56:06,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:56:06,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:56:06,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:56:06,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:56:06,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:12" (3/4) ... [2024-11-06 19:56:06,611 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:56:06,633 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:56:06,635 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:56:06,637 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:56:06,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:56:06,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:56:06,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:56:06,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:56:06,807 INFO L158 Benchmark]: Toolchain (without parser) took 58304.88ms. Allocated memory was 100.7MB in the beginning and 620.8MB in the end (delta: 520.1MB). Free memory was 72.0MB in the beginning and 476.2MB in the end (delta: -404.2MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,807 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:56:06,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.84ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 61.3MB in the end (delta: 10.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 247.02ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 40.9MB in the end (delta: 20.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,808 INFO L158 Benchmark]: Boogie Preprocessor took 383.73ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 40.9MB in the beginning and 100.1MB in the end (delta: -59.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,809 INFO L158 Benchmark]: RCFGBuilder took 2767.38ms. Allocated memory is still 201.3MB. Free memory was 99.9MB in the beginning and 89.0MB in the end (delta: 11.0MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,809 INFO L158 Benchmark]: TraceAbstraction took 53906.39ms. Allocated memory was 201.3MB in the beginning and 620.8MB in the end (delta: 419.4MB). Free memory was 87.3MB in the beginning and 501.3MB in the end (delta: -414.0MB). Peak memory consumption was 455.8MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,809 INFO L158 Benchmark]: Witness Printer took 197.84ms. Allocated memory is still 620.8MB. Free memory was 501.3MB in the beginning and 476.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:56:06,810 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.72ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.84ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 61.3MB in the end (delta: 10.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 247.02ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 40.9MB in the end (delta: 20.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 383.73ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 40.9MB in the beginning and 100.1MB in the end (delta: -59.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2767.38ms. Allocated memory is still 201.3MB. Free memory was 99.9MB in the beginning and 89.0MB in the end (delta: 11.0MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * TraceAbstraction took 53906.39ms. Allocated memory was 201.3MB in the beginning and 620.8MB in the end (delta: 419.4MB). Free memory was 87.3MB in the beginning and 501.3MB in the end (delta: -414.0MB). Peak memory consumption was 455.8MB. Max. memory is 16.1GB. * Witness Printer took 197.84ms. Allocated memory is still 620.8MB. Free memory was 501.3MB in the beginning and 476.2MB 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.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: 209]: 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: 51.0s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9987 SdHoareTripleChecker+Valid, 28.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9987 mSDsluCounter, 7654 SdHoareTripleChecker+Invalid, 24.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 887 mSDsCounter, 4130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25205 IncrementalHoareTripleChecker+Invalid, 29335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4130 mSolverCounterUnsat, 6767 mSDtfsCounter, 25205 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2794 GetRequests, 2748 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24934occurred in iteration=20, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 29103 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 14921 NumberOfCodeBlocks, 14921 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 15513 ConstructedInterpolants, 0 QuantifiedInterpolants, 39403 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2512 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 18125/18620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((long long) 89 + a4) <= 0) && (((long long) a29 + 127) <= 0)) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 366639 + a0) <= 0)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 600001 + a0)))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) 600001 + a0)))) || ((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0)))) || ((((((long long) 42 + a4) <= 0) && (2 != a2)) && (0 <= ((long long) 599998 + a0))) && (((long long) 98 + a0) <= 0))) || ((2 != a2) && (((long long) 89 + a4) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 599998 + a0))) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (((long long) 366639 + a0) <= 0)) && (3 == a2)) && (a29 <= 43))) || ((44 <= a29) && (((long long) 89 + a4) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 600001 + a0)))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4)) && (0 <= ((long long) 600001 + a0)))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:56:06,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE