./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:08:33,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:08:33,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:08:33,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:08:33,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:08:33,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:08:33,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:08:33,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:08:33,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:08:33,898 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:08:33,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:08:33,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:08:33,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:08:33,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:08:33,906 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:08:33,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:08:33,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:08:33,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:08:33,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:08:33,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:08:33,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:08:33,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:08:33,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:08:33,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:08:33,908 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:08:33,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:08:33,909 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:08:33,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:08:33,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:08:33,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:08:33,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:08:33,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:08:33,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:08:33,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:08:33,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:08:33,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:08:33,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:08:33,913 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 18:08:34,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:08:34,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:08:34,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:08:34,135 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:08:34,135 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:08:34,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2023-11-22 18:08:35,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:08:35,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:08:35,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2023-11-22 18:08:35,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21080c9b/c02bad3dc1484c53b3ffa7fa7023a9d5/FLAGba82c4d27 [2023-11-22 18:08:35,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21080c9b/c02bad3dc1484c53b3ffa7fa7023a9d5 [2023-11-22 18:08:35,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:08:35,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:08:35,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:08:35,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:08:35,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:08:35,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bb8a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35, skipping insertion in model container [2023-11-22 18:08:35,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,462 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:08:35,563 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2023-11-22 18:08:35,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:08:35,596 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:08:35,605 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2023-11-22 18:08:35,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:08:35,622 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:08:35,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35 WrapperNode [2023-11-22 18:08:35,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:08:35,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:08:35,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:08:35,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:08:35,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,648 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2023-11-22 18:08:35,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:08:35,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:08:35,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:08:35,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:08:35,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,660 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,690 INFO L189 HeapSplitter]: Split 8 memory accesses to 2 slices as follows [2, 6] [2023-11-22 18:08:35,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:08:35,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:08:35,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:08:35,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:08:35,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (1/1) ... [2023-11-22 18:08:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:08:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:08:35,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:08:35,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:08:35,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:08:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:08:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:08:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:08:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:08:35,799 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-11-22 18:08:35,799 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-11-22 18:08:35,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:08:35,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:08:35,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:08:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:08:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:08:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 18:08:35,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 18:08:35,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:08:35,884 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:08:35,891 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:08:36,069 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:08:36,096 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:08:36,096 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 18:08:36,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:08:36 BoogieIcfgContainer [2023-11-22 18:08:36,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:08:36,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:08:36,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:08:36,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:08:36,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:08:35" (1/3) ... [2023-11-22 18:08:36,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53856c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:08:36, skipping insertion in model container [2023-11-22 18:08:36,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:35" (2/3) ... [2023-11-22 18:08:36,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53856c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:08:36, skipping insertion in model container [2023-11-22 18:08:36,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:08:36" (3/3) ... [2023-11-22 18:08:36,106 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2023-11-22 18:08:36,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:08:36,120 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:08:36,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:08:36,169 INFO L357 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, mHoare=true, 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;@19ca7852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:08:36,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:08:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:08:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 18:08:36,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:08:36,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:08:36,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:08:36,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:08:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1773256560, now seen corresponding path program 1 times [2023-11-22 18:08:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:08:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430969772] [2023-11-22 18:08:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:08:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:08:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:08:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 18:08:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:08:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430969772] [2023-11-22 18:08:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430969772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:08:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:08:36,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:08:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686347195] [2023-11-22 18:08:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:08:36,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:08:36,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:08:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:08:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:08:36,362 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:08:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:08:36,389 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-11-22 18:08:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:08:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-22 18:08:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:08:36,396 INFO L225 Difference]: With dead ends: 62 [2023-11-22 18:08:36,396 INFO L226 Difference]: Without dead ends: 30 [2023-11-22 18:08:36,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:08:36,401 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:08:36,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:08:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-22 18:08:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-22 18:08:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 18:08:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-22 18:08:36,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2023-11-22 18:08:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:08:36,466 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-22 18:08:36,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 18:08:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-11-22 18:08:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 18:08:36,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:08:36,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:08:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:08:36,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:08:36,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:08:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1634427412, now seen corresponding path program 1 times [2023-11-22 18:08:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:08:36,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200463773] [2023-11-22 18:08:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:08:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:08:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:08:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 18:08:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:08:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200463773] [2023-11-22 18:08:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200463773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:08:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:08:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:08:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769262243] [2023-11-22 18:08:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:08:36,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:08:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:08:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:08:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:08:36,716 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 18:08:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:08:36,875 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-11-22 18:08:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:08:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-11-22 18:08:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:08:36,881 INFO L225 Difference]: With dead ends: 54 [2023-11-22 18:08:36,882 INFO L226 Difference]: Without dead ends: 52 [2023-11-22 18:08:36,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:08:36,885 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:08:36,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 133 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:08:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-22 18:08:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-11-22 18:08:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-22 18:08:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-11-22 18:08:36,910 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2023-11-22 18:08:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:08:36,911 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-11-22 18:08:36,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 18:08:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-11-22 18:08:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 18:08:36,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:08:36,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:08:36,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:08:36,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:08:36,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:08:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1846124153, now seen corresponding path program 1 times [2023-11-22 18:08:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:08:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428869326] [2023-11-22 18:08:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:08:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:08:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:08:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:08:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 18:08:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:08:37,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428869326] [2023-11-22 18:08:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428869326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:08:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:08:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:08:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812005157] [2023-11-22 18:08:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:08:37,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:08:37,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:08:37,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:08:37,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:08:37,180 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 18:08:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:08:37,224 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-11-22 18:08:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:08:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-11-22 18:08:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:08:37,225 INFO L225 Difference]: With dead ends: 53 [2023-11-22 18:08:37,226 INFO L226 Difference]: Without dead ends: 45 [2023-11-22 18:08:37,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:08:37,227 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:08:37,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 155 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:08:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-22 18:08:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-22 18:08:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:08:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2023-11-22 18:08:37,234 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2023-11-22 18:08:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:08:37,234 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-11-22 18:08:37,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 18:08:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2023-11-22 18:08:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:08:37,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:08:37,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:08:37,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:08:37,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:08:37,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:08:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 179298221, now seen corresponding path program 1 times [2023-11-22 18:08:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:08:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574488765] [2023-11-22 18:08:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:08:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:08:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:08:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:08:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 18:08:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-22 18:08:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:08:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574488765] [2023-11-22 18:08:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574488765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:08:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353193862] [2023-11-22 18:08:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:08:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:08:37,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:08:37,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:08:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 18:08:37,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:08:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-22 18:08:37,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:08:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353193862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:08:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:08:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2023-11-22 18:08:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919580097] [2023-11-22 18:08:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:08:37,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 18:08:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:08:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 18:08:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:08:37,564 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 18:08:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:08:37,667 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-11-22 18:08:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:08:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-22 18:08:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:08:37,668 INFO L225 Difference]: With dead ends: 56 [2023-11-22 18:08:37,669 INFO L226 Difference]: Without dead ends: 54 [2023-11-22 18:08:37,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:08:37,670 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:08:37,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 142 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:08:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-22 18:08:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2023-11-22 18:08:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 18:08:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-22 18:08:37,675 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2023-11-22 18:08:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:08:37,675 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-22 18:08:37,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 18:08:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-22 18:08:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:08:37,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:08:37,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-22 18:08:37,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:08:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:08:37,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:08:37,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:08:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2056086235, now seen corresponding path program 1 times [2023-11-22 18:08:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:08:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127890874] [2023-11-22 18:08:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:08:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:08:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:08:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 18:08:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-22 18:08:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 18:08:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-22 18:08:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:08:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127890874] [2023-11-22 18:08:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127890874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:08:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857225964] [2023-11-22 18:08:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:08:38,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:08:38,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:08:38,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:08:38,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 18:08:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:08:38,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-22 18:08:38,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:08:38,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-22 18:08:38,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-11-22 18:08:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:08:38,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:08:42,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857225964] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:08:42,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:08:42,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 18 [2023-11-22 18:08:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138027830] [2023-11-22 18:08:42,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:08:42,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 18:08:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:08:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 18:08:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:08:42,531 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:08:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:08:42,695 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-11-22 18:08:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 18:08:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 38 [2023-11-22 18:08:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:08:42,696 INFO L225 Difference]: With dead ends: 38 [2023-11-22 18:08:42,696 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 18:08:42,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2023-11-22 18:08:42,697 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:08:42,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 178 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:08:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 18:08:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 18:08:42,698 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) [2023-11-22 18:08:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 18:08:42,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2023-11-22 18:08:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:08:42,698 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 18:08:42,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:08:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 18:08:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 18:08:42,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 18:08:42,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:08:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:08:42,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 18:08:43,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 18:08:43,114 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (= |ULTIMATE.start_main_~ax~1#1| 0) (= |ULTIMATE.start_main_~ai~1#1| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) [2023-11-22 18:08:43,114 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~n~0#1|) [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L902 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: true [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 26 27) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0))) (or (and (let ((.cse0 (<= (+ check_~y 1) check_~n))) (or (and .cse0 (<= 1 check_~x)) (and (= check_~x 0) (= |check_#in~x| 0) .cse0))) (= .cse1 (select |#memory_int#1| check_~a.base))) (not (= .cse1 (select |#memory_int#1| |check_#in~a.base|))) (< |check_#in~n| (+ |check_#in~y| 1)) (< |check_#in~x| 0))) [2023-11-22 18:08:43,115 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-11-22 18:08:43,115 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= .cse0 (select |#memory_int#1| |check_#in~a.base|))) (< |check_#in~n| (+ |check_#in~y| 1)) (and (let ((.cse1 (<= (+ check_~y 1) check_~n))) (or (and (<= 1 |check_#in~x|) .cse1 (<= 1 check_~x)) (and (= check_~x 0) (= |check_#in~x| 0) .cse1))) (= .cse0 (select |#memory_int#1| check_~a.base))) (< |check_#in~x| 0))) [2023-11-22 18:08:43,116 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= .cse0 (select |#memory_int#1| |check_#in~a.base|))) (< |check_#in~n| (+ |check_#in~y| 1)) (and (let ((.cse1 (<= (+ check_~y 1) check_~n))) (or (and (<= 1 |check_#in~x|) .cse1 (<= 1 check_~x)) (and (= check_~x 0) (= |check_#in~x| 0) .cse1))) (= .cse0 (select |#memory_int#1| check_~a.base))) (< |check_#in~x| 0))) [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 38) the Hoare annotation is: true [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= .cse0 (select |#memory_int#1| |check_#in~a.base|))) (and (<= 0 check_~x) (let ((.cse1 (<= (+ check_~y 1) check_~n))) (or (and .cse1 (<= 1 check_~x)) (and (= |check_#in~x| 0) .cse1))) (= .cse0 (select |#memory_int#1| check_~a.base)) (= check_~ai~0 0) (= check_~ax~0 0)) (< |check_#in~n| (+ |check_#in~y| 1)) (< |check_#in~x| 0))) [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 12) the Hoare annotation is: true [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point L11-3(lines 10 12) no Hoare annotation was computed. [2023-11-22 18:08:43,116 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2023-11-22 18:08:43,118 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-22 18:08:43,120 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 18:08:43,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:08:43 BoogieIcfgContainer [2023-11-22 18:08:43,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 18:08:43,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 18:08:43,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 18:08:43,124 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 18:08:43,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:08:36" (3/4) ... [2023-11-22 18:08:43,125 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 18:08:43,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-22 18:08:43,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2023-11-22 18:08:43,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-22 18:08:43,131 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2023-11-22 18:08:43,132 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-22 18:08:43,132 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-22 18:08:43,132 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 18:08:43,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 18:08:43,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 18:08:43,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 18:08:43,193 INFO L158 Benchmark]: Toolchain (without parser) took 7753.22ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 124.2MB in the beginning and 71.9MB in the end (delta: 52.3MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,193 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 157.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:08:43,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.85ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 113.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.89ms. Allocated memory is still 157.3MB. Free memory was 113.2MB in the beginning and 111.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,194 INFO L158 Benchmark]: Boogie Preprocessor took 50.64ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 109.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,194 INFO L158 Benchmark]: RCFGBuilder took 396.82ms. Allocated memory is still 157.3MB. Free memory was 109.6MB in the beginning and 95.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,194 INFO L158 Benchmark]: TraceAbstraction took 7023.32ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 95.0MB in the beginning and 77.2MB in the end (delta: 17.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,195 INFO L158 Benchmark]: Witness Printer took 69.23ms. Allocated memory is still 188.7MB. Free memory was 77.2MB in the beginning and 71.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 18:08:43,196 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.16ms. Allocated memory is still 157.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.85ms. Allocated memory is still 157.3MB. Free memory was 124.0MB in the beginning and 113.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.89ms. Allocated memory is still 157.3MB. Free memory was 113.2MB in the beginning and 111.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.64ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 109.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.82ms. Allocated memory is still 157.3MB. Free memory was 109.6MB in the beginning and 95.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7023.32ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 95.0MB in the beginning and 77.2MB in the end (delta: 17.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 69.23ms. Allocated memory is still 188.7MB. Free memory was 77.2MB in the beginning and 71.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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: 11]: 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 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 643 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 148 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 35 PreInvPairs, 44 NumberOfFragments, 222 HoareAnnotationTreeSize, 35 FomulaSimplifications, 171 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 329 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 202 ConstructedInterpolants, 13 QuantifiedInterpolants, 649 SizeOfPredicates, 20 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 63/78 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 RESULT: Ultimate proved your program to be correct! [2023-11-22 18:08:43,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE