./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i -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 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:10:39,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:10:39,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:10:39,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:10:39,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:10:39,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:10:39,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:10:39,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:10:39,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:10:39,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:10:39,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:10:39,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:10:39,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:10:39,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:10:39,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:10:39,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:10:39,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:10:39,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:10:39,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:10:39,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:10:39,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:10:39,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:10:39,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:10:39,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:10:39,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:10:39,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:10:39,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:10:39,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:10:39,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:10:39,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:10:39,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:10:39,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:10:39,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:10:39,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:10:39,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:10:39,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:10:39,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:10:39,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:10:39,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:10:39,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:10:39,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:10:39,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:10:39,711 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 -> 573a31c00e41ae75ac0c33bb566a9b1a0edc6ad80bfad98caf671cb01963ec0c [2024-10-12 15:10:39,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:10:40,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:10:40,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:10:40,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:10:40,004 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:10:40,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i [2024-10-12 15:10:41,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:10:41,559 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:10:41,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i [2024-10-12 15:10:41,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a942660e/674d0d8d849744eabbfc0950ff7f986d/FLAG246b15df4 [2024-10-12 15:10:41,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a942660e/674d0d8d849744eabbfc0950ff7f986d [2024-10-12 15:10:41,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:10:41,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:10:41,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:10:41,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:10:41,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:10:41,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:10:41" (1/1) ... [2024-10-12 15:10:41,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fee71c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:41, skipping insertion in model container [2024-10-12 15:10:41,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:10:41" (1/1) ... [2024-10-12 15:10:41,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:10:42,181 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i[1252,1265] [2024-10-12 15:10:42,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:10:42,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:10:42,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-2.i[1252,1265] [2024-10-12 15:10:42,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:10:42,237 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:10:42,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42 WrapperNode [2024-10-12 15:10:42,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:10:42,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:10:42,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:10:42,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:10:42,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,265 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-10-12 15:10:42,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:10:42,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:10:42,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:10:42,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:10:42,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,287 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-10-12 15:10:42,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:10:42,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:10:42,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:10:42,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:10:42,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (1/1) ... [2024-10-12 15:10:42,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:10:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:10:42,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:10:42,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:10:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:10:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:10:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:10:42,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:10:42,463 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:10:42,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:10:42,640 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 15:10:42,640 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:10:42,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:10:42,673 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 15:10:42,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:10:42 BoogieIcfgContainer [2024-10-12 15:10:42,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:10:42,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:10:42,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:10:42,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:10:42,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:10:41" (1/3) ... [2024-10-12 15:10:42,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136564f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:10:42, skipping insertion in model container [2024-10-12 15:10:42,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:10:42" (2/3) ... [2024-10-12 15:10:42,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136564f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:10:42, skipping insertion in model container [2024-10-12 15:10:42,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:10:42" (3/3) ... [2024-10-12 15:10:42,683 INFO L112 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2024-10-12 15:10:42,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:10:42,699 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:10:42,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:10:42,762 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;@50a66d4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:10:42,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:10:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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-10-12 15:10:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 15:10:42,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:42,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:42,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:42,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1572136648, now seen corresponding path program 1 times [2024-10-12 15:10:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878609736] [2024-10-12 15:10:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878609736] [2024-10-12 15:10:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878609736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:42,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:10:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174577207] [2024-10-12 15:10:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:10:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:10:42,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:10:42,967 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-12 15:10:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:42,985 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2024-10-12 15:10:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:10:42,987 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), 0 states have call successors, (0), 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 11 [2024-10-12 15:10:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:42,992 INFO L225 Difference]: With dead ends: 48 [2024-10-12 15:10:42,992 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 15:10:42,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:10:42,997 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:42,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:10:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 15:10:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 15:10:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-12 15:10:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-12 15:10:43,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-10-12 15:10:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-12 15:10:43,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-12 15:10:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-12 15:10:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 15:10:43,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:43,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:43,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:10:43,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:43,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2000257456, now seen corresponding path program 1 times [2024-10-12 15:10:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704027480] [2024-10-12 15:10:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704027480] [2024-10-12 15:10:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704027480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:10:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128017446] [2024-10-12 15:10:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:43,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:10:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:10:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:10:43,287 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-12 15:10:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:43,338 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2024-10-12 15:10:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:10:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-10-12 15:10:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:43,339 INFO L225 Difference]: With dead ends: 39 [2024-10-12 15:10:43,339 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 15:10:43,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:10:43,340 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:43,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:10:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 15:10:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 15:10:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-12 15:10:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-12 15:10:43,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 11 [2024-10-12 15:10:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:43,348 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-12 15:10:43,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-10-12 15:10:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-10-12 15:10:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 15:10:43,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:43,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:43,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:10:43,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1004108287, now seen corresponding path program 1 times [2024-10-12 15:10:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:43,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257957336] [2024-10-12 15:10:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:43,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:10:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154597810] [2024-10-12 15:10:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:43,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:43,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:10:43,414 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) [2024-10-12 15:10:43,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:10:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:43,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 15:10:43,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:10:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:43,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:10:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257957336] [2024-10-12 15:10:43,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:10:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154597810] [2024-10-12 15:10:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154597810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:10:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500726694] [2024-10-12 15:10:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:10:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:10:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:10:43,752 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-12 15:10:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:43,866 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-12 15:10:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:10:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-12 15:10:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:43,867 INFO L225 Difference]: With dead ends: 29 [2024-10-12 15:10:43,867 INFO L226 Difference]: Without dead ends: 25 [2024-10-12 15:10:43,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:10:43,869 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:10:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-12 15:10:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-12 15:10:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-12 15:10:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-12 15:10:43,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 12 [2024-10-12 15:10:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:43,879 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 15:10:43,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-12 15:10:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-12 15:10:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 15:10:43,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:43,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:43,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:10:44,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:44,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:44,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1004167869, now seen corresponding path program 1 times [2024-10-12 15:10:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:44,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111282769] [2024-10-12 15:10:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:10:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043227392] [2024-10-12 15:10:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:44,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:10:44,125 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) [2024-10-12 15:10:44,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:10:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:44,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 15:10:44,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:10:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:44,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:10:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111282769] [2024-10-12 15:10:44,355 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:10:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043227392] [2024-10-12 15:10:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043227392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:10:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13170671] [2024-10-12 15:10:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:44,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:10:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:10:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:10:44,361 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-12 15:10:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:44,448 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-10-12 15:10:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:10:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-12 15:10:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:44,449 INFO L225 Difference]: With dead ends: 28 [2024-10-12 15:10:44,449 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 15:10:44,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:10:44,451 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:44,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:10:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 15:10:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 15:10:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 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-10-12 15:10:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-12 15:10:44,455 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2024-10-12 15:10:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:44,456 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-12 15:10:44,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-12 15:10:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-10-12 15:10:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 15:10:44,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:44,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:44,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:10:44,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 15:10:44,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:44,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1421175221, now seen corresponding path program 1 times [2024-10-12 15:10:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368762792] [2024-10-12 15:10:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368762792] [2024-10-12 15:10:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368762792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:10:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691714796] [2024-10-12 15:10:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:10:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:10:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:10:44,753 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-12 15:10:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:44,803 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-10-12 15:10:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:10:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-12 15:10:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:44,805 INFO L225 Difference]: With dead ends: 44 [2024-10-12 15:10:44,805 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 15:10:44,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:10:44,806 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:44,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:10:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 15:10:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-12 15:10:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-12 15:10:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-12 15:10:44,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 15 [2024-10-12 15:10:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-12 15:10:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-12 15:10:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-12 15:10:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:10:44,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:44,811 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] [2024-10-12 15:10:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:10:44,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:44,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash -314952164, now seen corresponding path program 1 times [2024-10-12 15:10:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:44,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484049332] [2024-10-12 15:10:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:10:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484049332] [2024-10-12 15:10:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484049332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:10:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575348014] [2024-10-12 15:10:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:10:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:10:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:10:44,859 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-12 15:10:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:44,893 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-12 15:10:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:10:44,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-12 15:10:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:44,894 INFO L225 Difference]: With dead ends: 46 [2024-10-12 15:10:44,894 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 15:10:44,906 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-10-12 15:10:44,907 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:44,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:10:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 15:10:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-12 15:10:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-12 15:10:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-12 15:10:44,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2024-10-12 15:10:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-12 15:10:44,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-12 15:10:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-12 15:10:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 15:10:44,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:44,916 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] [2024-10-12 15:10:44,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:10:44,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -645694737, now seen corresponding path program 1 times [2024-10-12 15:10:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450302440] [2024-10-12 15:10:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:10:45,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450302440] [2024-10-12 15:10:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450302440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 15:10:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559114345] [2024-10-12 15:10:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 15:10:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 15:10:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:10:45,073 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-10-12 15:10:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:45,153 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-10-12 15:10:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 15:10:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-12 15:10:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:45,154 INFO L225 Difference]: With dead ends: 51 [2024-10-12 15:10:45,154 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 15:10:45,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:10:45,155 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:45,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:10:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 15:10:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 15:10:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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-10-12 15:10:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-12 15:10:45,162 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 22 [2024-10-12 15:10:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:45,162 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-12 15:10:45,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-10-12 15:10:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-12 15:10:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:10:45,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:45,163 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] [2024-10-12 15:10:45,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:10:45,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:45,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 319122910, now seen corresponding path program 1 times [2024-10-12 15:10:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427345241] [2024-10-12 15:10:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:10:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620925446] [2024-10-12 15:10:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:45,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:45,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:10:45,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:10:45,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:10:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:45,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 15:10:45,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:10:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:10:45,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:10:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427345241] [2024-10-12 15:10:45,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:10:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620925446] [2024-10-12 15:10:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620925446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:45,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:45,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:10:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523826071] [2024-10-12 15:10:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:10:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:10:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:10:45,453 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-12 15:10:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:45,525 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-12 15:10:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:10:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-12 15:10:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:45,526 INFO L225 Difference]: With dead ends: 37 [2024-10-12 15:10:45,526 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 15:10:45,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:10:45,530 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:45,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:10:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 15:10:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 15:10:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 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-10-12 15:10:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-12 15:10:45,543 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2024-10-12 15:10:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 15:10:45,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-12 15:10:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-12 15:10:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:10:45,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:10:45,545 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] [2024-10-12 15:10:45,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:10:45,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:45,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:10:45,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:10:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash 319182492, now seen corresponding path program 1 times [2024-10-12 15:10:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:10:45,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639683430] [2024-10-12 15:10:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:10:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:10:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685897307] [2024-10-12 15:10:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:10:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:45,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:10:45,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:10:45,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:10:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:10:45,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 15:10:45,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:10:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:10:46,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:10:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:10:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639683430] [2024-10-12 15:10:46,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:10:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685897307] [2024-10-12 15:10:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685897307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:10:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:10:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 15:10:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056031487] [2024-10-12 15:10:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:10:46,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:10:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:10:46,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:10:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:10:46,153 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-12 15:10:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:10:46,191 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-12 15:10:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:10:46,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-12 15:10:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:10:46,192 INFO L225 Difference]: With dead ends: 33 [2024-10-12 15:10:46,192 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:10:46,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:10:46,193 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:10:46,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:10:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:10:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:10:46,193 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-10-12 15:10:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:10:46,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-10-12 15:10:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:10:46,194 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:10:46,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-10-12 15:10:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:10:46,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:10:46,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:10:46,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:10:46,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:10:46,400 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:10:46,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:10:46,452 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:10:46,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:10:46 BoogieIcfgContainer [2024-10-12 15:10:46,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:10:46,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:10:46,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:10:46,468 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:10:46,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:10:42" (3/4) ... [2024-10-12 15:10:46,470 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:10:46,476 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-12 15:10:46,477 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-12 15:10:46,477 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:10:46,477 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:10:46,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:10:46,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:10:46,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:10:46,562 INFO L158 Benchmark]: Toolchain (without parser) took 4609.88ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 74.5MB in the beginning and 101.5MB in the end (delta: -27.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,563 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:10:46,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.37ms. Allocated memory is still 148.9MB. Free memory was 74.2MB in the beginning and 116.0MB in the end (delta: -41.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 148.9MB. Free memory was 116.0MB in the beginning and 114.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:10:46,563 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 148.9MB. Free memory was 114.6MB in the beginning and 113.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,564 INFO L158 Benchmark]: RCFGBuilder took 372.89ms. Allocated memory is still 148.9MB. Free memory was 112.5MB in the beginning and 100.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,564 INFO L158 Benchmark]: TraceAbstraction took 3792.20ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.3MB in the beginning and 105.7MB in the end (delta: -6.4MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,564 INFO L158 Benchmark]: Witness Printer took 94.06ms. Allocated memory is still 180.4MB. Free memory was 105.7MB in the beginning and 101.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:10:46,566 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.17ms. Allocated memory is still 148.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.37ms. Allocated memory is still 148.9MB. Free memory was 74.2MB in the beginning and 116.0MB in the end (delta: -41.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 148.9MB. Free memory was 116.0MB in the beginning and 114.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.47ms. Allocated memory is still 148.9MB. Free memory was 114.6MB in the beginning and 113.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.89ms. Allocated memory is still 148.9MB. Free memory was 112.5MB in the beginning and 100.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3792.20ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 99.3MB in the beginning and 105.7MB in the end (delta: -6.4MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 94.06ms. Allocated memory is still 180.4MB. Free memory was 105.7MB in the beginning and 101.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 174 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=7, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 619 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 9/9 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: 54]: Loop Invariant Derived loop invariant: ((1 <= d) && (m == n)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((1 <= d) && (d <= 4294967294)) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:10:46,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE