./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label37.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/Problem11_label37.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', '06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8'] 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/Problem11_label37.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 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:39:00,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:39:00,972 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:39:00,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:39:00,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:39:01,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:39:01,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:39:01,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:39:01,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:39:01,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:39:01,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:39:01,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:39:01,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:39:01,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:39:01,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:39:01,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:39:01,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:39:01,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:39:01,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:01,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:39:01,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:39:01,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:39:01,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:39:01,019 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 -> 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 [2024-11-06 19:39:01,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:39:01,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:39:01,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:39:01,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:39:01,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:39:01,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2024-11-06 19:39:02,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:39:03,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:39:03,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2024-11-06 19:39:03,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cf066fe6/1aad0d1bac9e4f0d9fe0f7821736b325/FLAG9af5901cc [2024-11-06 19:39:03,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cf066fe6/1aad0d1bac9e4f0d9fe0f7821736b325 [2024-11-06 19:39:03,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:39:03,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:39:03,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:03,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:39:03,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:39:03,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:03,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca0651f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03, skipping insertion in model container [2024-11-06 19:39:03,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:03,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:39:03,384 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/Problem11_label37.c[7136,7149] [2024-11-06 19:39:03,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:03,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:39:03,692 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/Problem11_label37.c[7136,7149] [2024-11-06 19:39:03,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:03,827 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:39:03,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03 WrapperNode [2024-11-06 19:39:03,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:03,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:03,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:39:03,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:39:03,835 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:39:03" (1/1) ... [2024-11-06 19:39:03,859 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:39:03" (1/1) ... [2024-11-06 19:39:03,945 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:39:03,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:03,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:39:03,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:39:03,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:39:03,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:03,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:03,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,014 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:39:04,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:39:04,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:39:04,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:39:04,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:39:04,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (1/1) ... [2024-11-06 19:39:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:04,181 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:39:04,184 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:39:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:39:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:39:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:39:04,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:39:04,276 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:39:04,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:39:05,842 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:39:05,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:39:05,857 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:39:05,858 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:39:05,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:05 BoogieIcfgContainer [2024-11-06 19:39:05,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:39:05,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:39:05,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:39:05,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:39:05,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:39:03" (1/3) ... [2024-11-06 19:39:05,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f24852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:05, skipping insertion in model container [2024-11-06 19:39:05,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:03" (2/3) ... [2024-11-06 19:39:05,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f24852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:05, skipping insertion in model container [2024-11-06 19:39:05,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:05" (3/3) ... [2024-11-06 19:39:05,868 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label37.c [2024-11-06 19:39:05,881 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:39:05,881 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:39:05,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:39:05,938 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;@395afe77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:39:05,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:39:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have 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:39:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 19:39:05,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:05,951 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] [2024-11-06 19:39:05,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2024-11-06 19:39:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752011391] [2024-11-06 19:39:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:06,326 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:39:06,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752011391] [2024-11-06 19:39:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752011391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:06,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542767362] [2024-11-06 19:39:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:06,361 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:39:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:07,532 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-06 19:39:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-06 19:39:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:07,547 INFO L225 Difference]: With dead ends: 761 [2024-11-06 19:39:07,549 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:39:07,553 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:39:07,557 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 179 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:07,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:39:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:39:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-06 19:39:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have 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:39:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-06 19:39:07,614 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 49 [2024-11-06 19:39:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:07,614 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-06 19:39:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:39:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-06 19:39:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 19:39:07,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:07,618 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, 1, 1, 1, 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:39:07,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:39:07,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:07,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1853530912, now seen corresponding path program 1 times [2024-11-06 19:39:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108840230] [2024-11-06 19:39:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:07,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108840230] [2024-11-06 19:39:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108840230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748519306] [2024-11-06 19:39:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:07,955 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:39:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:08,731 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-06 19:39:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-06 19:39:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:08,737 INFO L225 Difference]: With dead ends: 1211 [2024-11-06 19:39:08,739 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:39:08,741 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:39:08,744 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:08,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:39:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-06 19:39:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have 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:39:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-06 19:39:08,787 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 117 [2024-11-06 19:39:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-06 19:39:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:39:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-06 19:39:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 19:39:08,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:08,790 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, 1, 1, 1, 1, 1, 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:39:08,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:39:08,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1352493349, now seen corresponding path program 1 times [2024-11-06 19:39:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489535834] [2024-11-06 19:39:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489535834] [2024-11-06 19:39:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489535834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377516823] [2024-11-06 19:39:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:09,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:09,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:09,203 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:39:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:09,902 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-06 19:39:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:09,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-06 19:39:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:09,907 INFO L225 Difference]: With dead ends: 1945 [2024-11-06 19:39:09,908 INFO L226 Difference]: Without dead ends: 1158 [2024-11-06 19:39:09,909 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:39:09,909 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:09,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-06 19:39:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-06 19:39:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have 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:39:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-06 19:39:09,943 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 119 [2024-11-06 19:39:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:09,943 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-06 19:39:09,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:39:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-06 19:39:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-06 19:39:09,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:09,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:39:09,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:09,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2073470789, now seen corresponding path program 1 times [2024-11-06 19:39:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211324309] [2024-11-06 19:39:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211324309] [2024-11-06 19:39:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211324309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301258258] [2024-11-06 19:39:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:10,285 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:39:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:11,542 INFO L93 Difference]: Finished difference Result 3445 states and 4564 transitions. [2024-11-06 19:39:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2024-11-06 19:39:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:11,552 INFO L225 Difference]: With dead ends: 3445 [2024-11-06 19:39:11,553 INFO L226 Difference]: Without dead ends: 2474 [2024-11-06 19:39:11,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:11,555 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 345 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:11,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:39:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2024-11-06 19:39:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2473. [2024-11-06 19:39:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.286812297734628) internal successors, (3181), 2472 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have 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:39:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3181 transitions. [2024-11-06 19:39:11,618 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3181 transitions. Word has length 176 [2024-11-06 19:39:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:11,619 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3181 transitions. [2024-11-06 19:39:11,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:39:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3181 transitions. [2024-11-06 19:39:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-06 19:39:11,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:11,624 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, 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] [2024-11-06 19:39:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:39:11,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1865808472, now seen corresponding path program 1 times [2024-11-06 19:39:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087731437] [2024-11-06 19:39:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 19:39:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087731437] [2024-11-06 19:39:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087731437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952109168] [2024-11-06 19:39:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:11,938 INFO L87 Difference]: Start difference. First operand 2473 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:39:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:12,784 INFO L93 Difference]: Finished difference Result 5690 states and 7506 transitions. [2024-11-06 19:39:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 231 [2024-11-06 19:39:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:12,798 INFO L225 Difference]: With dead ends: 5690 [2024-11-06 19:39:12,798 INFO L226 Difference]: Without dead ends: 3587 [2024-11-06 19:39:12,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:12,801 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 148 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:12,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 393 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2024-11-06 19:39:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3578. [2024-11-06 19:39:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3578 states, 3577 states have (on average 1.25020967291026) internal successors, (4472), 3577 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have 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:39:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4472 transitions. [2024-11-06 19:39:12,863 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4472 transitions. Word has length 231 [2024-11-06 19:39:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:12,864 INFO L471 AbstractCegarLoop]: Abstraction has 3578 states and 4472 transitions. [2024-11-06 19:39:12,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:39:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4472 transitions. [2024-11-06 19:39:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-06 19:39:12,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:12,868 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, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:39:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:39:12,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash -302767753, now seen corresponding path program 1 times [2024-11-06 19:39:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42081522] [2024-11-06 19:39:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:39:13,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42081522] [2024-11-06 19:39:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42081522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:39:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032365774] [2024-11-06 19:39:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:13,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:39:13,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:13,447 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:39:13,449 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:39:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:13,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:39:13,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:39:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:39:13,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:39:13,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032365774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:13,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:39:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:39:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957138131] [2024-11-06 19:39:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:13,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:39:13,698 INFO L87 Difference]: Start difference. First operand 3578 states and 4472 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:39:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:14,563 INFO L93 Difference]: Finished difference Result 9363 states and 11939 transitions. [2024-11-06 19:39:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 237 [2024-11-06 19:39:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:14,587 INFO L225 Difference]: With dead ends: 9363 [2024-11-06 19:39:14,588 INFO L226 Difference]: Without dead ends: 6155 [2024-11-06 19:39:14,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:39:14,594 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 162 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:14,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 145 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2024-11-06 19:39:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 6155. [2024-11-06 19:39:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.2351316217094572) internal successors, (7601), 6154 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have 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:39:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 7601 transitions. [2024-11-06 19:39:14,708 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 7601 transitions. Word has length 237 [2024-11-06 19:39:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:14,708 INFO L471 AbstractCegarLoop]: Abstraction has 6155 states and 7601 transitions. [2024-11-06 19:39:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have 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:39:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 7601 transitions. [2024-11-06 19:39:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 19:39:14,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:14,715 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:39:14,734 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:39:14,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:39:14,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:14,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -952287798, now seen corresponding path program 1 times [2024-11-06 19:39:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706883305] [2024-11-06 19:39:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-06 19:39:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706883305] [2024-11-06 19:39:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706883305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225270289] [2024-11-06 19:39:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:15,175 INFO L87 Difference]: Start difference. First operand 6155 states and 7601 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:39:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:16,067 INFO L93 Difference]: Finished difference Result 14156 states and 17736 transitions. [2024-11-06 19:39:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:16,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 268 [2024-11-06 19:39:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:16,093 INFO L225 Difference]: With dead ends: 14156 [2024-11-06 19:39:16,093 INFO L226 Difference]: Without dead ends: 8187 [2024-11-06 19:39:16,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:16,102 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 147 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:16,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2024-11-06 19:39:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8179. [2024-11-06 19:39:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8179 states, 8178 states have (on average 1.214844705306921) internal successors, (9935), 8178 states have internal predecessors, (9935), 0 states have call successors, (0), 0 states have 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:39:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8179 states to 8179 states and 9935 transitions. [2024-11-06 19:39:16,249 INFO L78 Accepts]: Start accepts. Automaton has 8179 states and 9935 transitions. Word has length 268 [2024-11-06 19:39:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:16,250 INFO L471 AbstractCegarLoop]: Abstraction has 8179 states and 9935 transitions. [2024-11-06 19:39:16,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:39:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8179 states and 9935 transitions. [2024-11-06 19:39:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-06 19:39:16,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:16,257 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:39:16,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:39:16,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1237229329, now seen corresponding path program 1 times [2024-11-06 19:39:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956316755] [2024-11-06 19:39:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:16,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956316755] [2024-11-06 19:39:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956316755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:16,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:16,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 19:39:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641046105] [2024-11-06 19:39:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:16,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 19:39:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 19:39:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:39:16,986 INFO L87 Difference]: Start difference. First operand 8179 states and 9935 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:18,755 INFO L93 Difference]: Finished difference Result 17504 states and 21220 transitions. [2024-11-06 19:39:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 19:39:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-11-06 19:39:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:18,797 INFO L225 Difference]: With dead ends: 17504 [2024-11-06 19:39:18,797 INFO L226 Difference]: Without dead ends: 9695 [2024-11-06 19:39:18,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:39:18,808 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 533 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:18,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 184 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 19:39:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2024-11-06 19:39:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 9652. [2024-11-06 19:39:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9652 states, 9651 states have (on average 1.1942803854522848) internal successors, (11526), 9651 states have internal predecessors, (11526), 0 states have call successors, (0), 0 states have 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:39:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9652 states to 9652 states and 11526 transitions. [2024-11-06 19:39:18,980 INFO L78 Accepts]: Start accepts. Automaton has 9652 states and 11526 transitions. Word has length 290 [2024-11-06 19:39:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:18,980 INFO L471 AbstractCegarLoop]: Abstraction has 9652 states and 11526 transitions. [2024-11-06 19:39:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 9652 states and 11526 transitions. [2024-11-06 19:39:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-06 19:39:19,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:19,025 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:39:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:39:19,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:19,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 489646399, now seen corresponding path program 1 times [2024-11-06 19:39:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508115046] [2024-11-06 19:39:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 19:39:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508115046] [2024-11-06 19:39:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508115046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92132909] [2024-11-06 19:39:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:19,208 INFO L87 Difference]: Start difference. First operand 9652 states and 11526 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:39:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:20,019 INFO L93 Difference]: Finished difference Result 19849 states and 24229 transitions. [2024-11-06 19:39:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 295 [2024-11-06 19:39:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:20,045 INFO L225 Difference]: With dead ends: 19849 [2024-11-06 19:39:20,045 INFO L226 Difference]: Without dead ends: 11858 [2024-11-06 19:39:20,054 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:39:20,055 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 178 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:20,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 324 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2024-11-06 19:39:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11673. [2024-11-06 19:39:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11673 states, 11672 states have (on average 1.202535983550377) internal successors, (14036), 11672 states have internal predecessors, (14036), 0 states have call successors, (0), 0 states have 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:39:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 14036 transitions. [2024-11-06 19:39:20,224 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 14036 transitions. Word has length 295 [2024-11-06 19:39:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:20,226 INFO L471 AbstractCegarLoop]: Abstraction has 11673 states and 14036 transitions. [2024-11-06 19:39:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:39:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 14036 transitions. [2024-11-06 19:39:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-06 19:39:20,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:20,236 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:39:20,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:20,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:20,239 INFO L85 PathProgramCache]: Analyzing trace with hash -152658604, now seen corresponding path program 1 times [2024-11-06 19:39:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98340581] [2024-11-06 19:39:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-06 19:39:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98340581] [2024-11-06 19:39:20,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98340581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:20,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:20,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69764272] [2024-11-06 19:39:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:20,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:20,497 INFO L87 Difference]: Start difference. First operand 11673 states and 14036 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have 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:39:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:21,346 INFO L93 Difference]: Finished difference Result 24076 states and 29427 transitions. [2024-11-06 19:39:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 314 [2024-11-06 19:39:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:21,378 INFO L225 Difference]: With dead ends: 24076 [2024-11-06 19:39:21,379 INFO L226 Difference]: Without dead ends: 14064 [2024-11-06 19:39:21,391 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:39:21,395 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:21,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 148 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14064 states. [2024-11-06 19:39:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14064 to 12586. [2024-11-06 19:39:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12586 states, 12585 states have (on average 1.1836313071116409) internal successors, (14896), 12585 states have internal predecessors, (14896), 0 states have call successors, (0), 0 states have 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:39:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12586 states to 12586 states and 14896 transitions. [2024-11-06 19:39:21,585 INFO L78 Accepts]: Start accepts. Automaton has 12586 states and 14896 transitions. Word has length 314 [2024-11-06 19:39:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:21,586 INFO L471 AbstractCegarLoop]: Abstraction has 12586 states and 14896 transitions. [2024-11-06 19:39:21,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have 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:39:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12586 states and 14896 transitions. [2024-11-06 19:39:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-06 19:39:21,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:21,601 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:39:21,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1589198225, now seen corresponding path program 1 times [2024-11-06 19:39:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291494970] [2024-11-06 19:39:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:21,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:22,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291494970] [2024-11-06 19:39:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291494970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:22,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266929932] [2024-11-06 19:39:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:22,011 INFO L87 Difference]: Start difference. First operand 12586 states and 14896 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:39:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:23,336 INFO L93 Difference]: Finished difference Result 29974 states and 36006 transitions. [2024-11-06 19:39:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2024-11-06 19:39:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:23,375 INFO L225 Difference]: With dead ends: 29974 [2024-11-06 19:39:23,375 INFO L226 Difference]: Without dead ends: 19049 [2024-11-06 19:39:23,389 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:39:23,390 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 241 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:23,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 68 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:39:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19049 states. [2024-11-06 19:39:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19049 to 17933. [2024-11-06 19:39:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17933 states, 17932 states have (on average 1.1789538255632388) internal successors, (21141), 17932 states have internal predecessors, (21141), 0 states have call successors, (0), 0 states have 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:39:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17933 states to 17933 states and 21141 transitions. [2024-11-06 19:39:23,597 INFO L78 Accepts]: Start accepts. Automaton has 17933 states and 21141 transitions. Word has length 354 [2024-11-06 19:39:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:23,649 INFO L471 AbstractCegarLoop]: Abstraction has 17933 states and 21141 transitions. [2024-11-06 19:39:23,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:39:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 17933 states and 21141 transitions. [2024-11-06 19:39:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-11-06 19:39:23,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:23,674 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:39:23,675 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 576049221, now seen corresponding path program 1 times [2024-11-06 19:39:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21608501] [2024-11-06 19:39:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-06 19:39:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21608501] [2024-11-06 19:39:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21608501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:24,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:39:24,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562676996] [2024-11-06 19:39:24,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:24,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:24,122 INFO L87 Difference]: Start difference. First operand 17933 states and 21141 transitions. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:25,462 INFO L93 Difference]: Finished difference Result 37904 states and 45130 transitions. [2024-11-06 19:39:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2024-11-06 19:39:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:25,512 INFO L225 Difference]: With dead ends: 37904 [2024-11-06 19:39:25,513 INFO L226 Difference]: Without dead ends: 21632 [2024-11-06 19:39:25,530 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:39:25,531 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 241 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:25,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 68 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:39:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21632 states. [2024-11-06 19:39:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21632 to 17565. [2024-11-06 19:39:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17565 states, 17564 states have (on average 1.1796287861534958) internal successors, (20719), 17564 states have internal predecessors, (20719), 0 states have call successors, (0), 0 states have 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:39:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17565 states to 17565 states and 20719 transitions. [2024-11-06 19:39:25,758 INFO L78 Accepts]: Start accepts. Automaton has 17565 states and 20719 transitions. Word has length 428 [2024-11-06 19:39:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 17565 states and 20719 transitions. [2024-11-06 19:39:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 17565 states and 20719 transitions. [2024-11-06 19:39:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-11-06 19:39:25,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:25,792 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:39:25,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:25,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1737943324, now seen corresponding path program 1 times [2024-11-06 19:39:25,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:25,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187074651] [2024-11-06 19:39:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-06 19:39:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187074651] [2024-11-06 19:39:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187074651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:26,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187159745] [2024-11-06 19:39:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:26,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:26,086 INFO L87 Difference]: Start difference. First operand 17565 states and 20719 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have 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:39:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:26,632 INFO L93 Difference]: Finished difference Result 31991 states and 37835 transitions. [2024-11-06 19:39:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:26,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 601 [2024-11-06 19:39:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:26,651 INFO L225 Difference]: With dead ends: 31991 [2024-11-06 19:39:26,651 INFO L226 Difference]: Without dead ends: 16087 [2024-11-06 19:39:26,663 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:39:26,663 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:26,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 149 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16087 states. [2024-11-06 19:39:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16087 to 13693. [2024-11-06 19:39:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13693 states, 13692 states have (on average 1.1394244814490213) internal successors, (15601), 13692 states have internal predecessors, (15601), 0 states have call successors, (0), 0 states have 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:39:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13693 states to 13693 states and 15601 transitions. [2024-11-06 19:39:26,820 INFO L78 Accepts]: Start accepts. Automaton has 13693 states and 15601 transitions. Word has length 601 [2024-11-06 19:39:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 13693 states and 15601 transitions. [2024-11-06 19:39:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have 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:39:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13693 states and 15601 transitions. [2024-11-06 19:39:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2024-11-06 19:39:26,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:26,841 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:26,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:39:26,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:26,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash -266313895, now seen corresponding path program 1 times [2024-11-06 19:39:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:26,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623122415] [2024-11-06 19:39:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2024-11-06 19:39:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623122415] [2024-11-06 19:39:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623122415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:27,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:27,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907999745] [2024-11-06 19:39:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:27,146 INFO L87 Difference]: Start difference. First operand 13693 states and 15601 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:27,809 INFO L93 Difference]: Finished difference Result 27379 states and 31297 transitions. [2024-11-06 19:39:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 692 [2024-11-06 19:39:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:27,811 INFO L225 Difference]: With dead ends: 27379 [2024-11-06 19:39:27,811 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:39:27,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:27,824 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:27,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 365 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:39:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:39:27,826 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:39:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:39:27,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 692 [2024-11-06 19:39:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:39:27,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:39:27,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:39:27,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:39:27,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:39:27,833 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:27,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:39:29,158 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:39:29,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:39:29 BoogieIcfgContainer [2024-11-06 19:39:29,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:39:29,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:39:29,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:39:29,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:39:29,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:05" (3/4) ... [2024-11-06 19:39:29,179 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:39:29,205 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:39:29,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:39:29,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:39:29,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:39:29,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:39:29,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:39:29,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:39:29,367 INFO L158 Benchmark]: Toolchain (without parser) took 26256.47ms. Allocated memory was 100.7MB in the beginning and 637.5MB in the end (delta: 536.9MB). Free memory was 73.9MB in the beginning and 188.0MB in the end (delta: -114.1MB). Peak memory consumption was 420.6MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,367 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:39:29,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.87ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 65.2MB in the end (delta: 8.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.80ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 48.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,368 INFO L158 Benchmark]: Boogie Preprocessor took 202.14ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 59.5MB in the end (delta: -11.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,369 INFO L158 Benchmark]: RCFGBuilder took 1708.24ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 100.1MB in the end (delta: -40.6MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,369 INFO L158 Benchmark]: TraceAbstraction took 23315.31ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 98.9MB in the beginning and 204.7MB in the end (delta: -105.8MB). Peak memory consumption was 479.4MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,369 INFO L158 Benchmark]: Witness Printer took 189.82ms. Allocated memory is still 637.5MB. Free memory was 200.5MB in the beginning and 188.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:39:29,371 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.80ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.87ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 65.2MB in the end (delta: 8.6MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.80ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 48.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 202.14ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 59.5MB in the end (delta: -11.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1708.24ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 100.1MB in the end (delta: -40.6MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23315.31ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 98.9MB in the beginning and 204.7MB in the end (delta: -105.8MB). Peak memory consumption was 479.4MB. Max. memory is 16.1GB. * Witness Printer took 189.82ms. Allocated memory is still 637.5MB. Free memory was 200.5MB in the beginning and 188.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. 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: 163]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2906 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2906 mSDsluCounter, 2854 SdHoareTripleChecker+Invalid, 10.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 399 mSDsCounter, 2040 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10417 IncrementalHoareTripleChecker+Invalid, 12457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2040 mSolverCounterUnsat, 2455 mSDtfsCounter, 10417 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17933occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 9313 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4408 NumberOfCodeBlocks, 4408 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4393 ConstructedInterpolants, 0 QuantifiedInterpolants, 13452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 346 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 4681/4683 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a29 <= 599998) && (a4 != 1)) || (((a25 <= 10) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0))) || (((long long) a29 + 21) <= 0)) || ((((307 <= a23) && (a25 == 11)) && (a29 <= 599999)) && (a4 == 1))) || ((a25 == 11) && (a29 <= 599998))) || ((a25 == 13) && (a29 <= 599998))) || ((307 <= a23) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:39:29,398 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