./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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/reducercommutativity/rangesum05.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 aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 16:43:24,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 16:43:24,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 16:43:24,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 16:43:24,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 16:43:24,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 16:43:24,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 16:43:24,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 16:43:24,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 16:43:24,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 16:43:24,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 16:43:24,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 16:43:24,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 16:43:24,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 16:43:24,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 16:43:24,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 16:43:24,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 16:43:24,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 16:43:24,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 16:43:24,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 16:43:24,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 16:43:24,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 16:43:24,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 16:43:24,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 16:43:24,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 16:43:24,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 16:43:24,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 16:43:24,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 16:43:24,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 16:43:24,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 16:43:24,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 16:43:24,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 16:43:24,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 16:43:24,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 16:43:24,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 16:43:24,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 16:43:24,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 16:43:24,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 16:43:24,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 16:43:24,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 16:43:24,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 16:43:24,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 16:43:24,977 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 -> aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 [2024-11-19 16:43:25,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 16:43:25,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 16:43:25,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 16:43:25,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 16:43:25,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 16:43:25,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2024-11-19 16:43:26,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 16:43:26,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 16:43:26,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2024-11-19 16:43:26,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf31c051/70a74506929f45a98a39514d1e8d6eaf/FLAG1dd2d8192 [2024-11-19 16:43:27,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf31c051/70a74506929f45a98a39514d1e8d6eaf [2024-11-19 16:43:27,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 16:43:27,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 16:43:27,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 16:43:27,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 16:43:27,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 16:43:27,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27102cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27, skipping insertion in model container [2024-11-19 16:43:27,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 16:43:27,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-11-19 16:43:27,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 16:43:27,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 16:43:27,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-11-19 16:43:27,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 16:43:27,259 INFO L204 MainTranslator]: Completed translation [2024-11-19 16:43:27,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27 WrapperNode [2024-11-19 16:43:27,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 16:43:27,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 16:43:27,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 16:43:27,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 16:43:27,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,287 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-19 16:43:27,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 16:43:27,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 16:43:27,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 16:43:27,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 16:43:27,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,306 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 16:43:27,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 16:43:27,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 16:43:27,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 16:43:27,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 16:43:27,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (1/1) ... [2024-11-19 16:43:27,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 16:43:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:27,343 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-11-19 16:43:27,345 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-11-19 16:43:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 16:43:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 16:43:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 16:43:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 16:43:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 16:43:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 16:43:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 16:43:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 16:43:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 16:43:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 16:43:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-19 16:43:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-19 16:43:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 16:43:27,449 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 16:43:27,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 16:43:27,591 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-19 16:43:27,591 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 16:43:27,600 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 16:43:27,600 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 16:43:27,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:27 BoogieIcfgContainer [2024-11-19 16:43:27,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 16:43:27,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 16:43:27,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 16:43:27,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 16:43:27,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:43:27" (1/3) ... [2024-11-19 16:43:27,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92476e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:43:27, skipping insertion in model container [2024-11-19 16:43:27,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:43:27" (2/3) ... [2024-11-19 16:43:27,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92476e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:43:27, skipping insertion in model container [2024-11-19 16:43:27,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:27" (3/3) ... [2024-11-19 16:43:27,610 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2024-11-19 16:43:27,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 16:43:27,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 16:43:27,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 16:43:27,686 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;@75523ae4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 16:43:27,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 16:43:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 16:43:27,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:27,699 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:27,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-19 16:43:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397840319] [2024-11-19 16:43:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:27,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 16:43:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:27,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 16:43:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 16:43:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 16:43:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397840319] [2024-11-19 16:43:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397840319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 16:43:28,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 16:43:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 16:43:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256190291] [2024-11-19 16:43:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 16:43:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 16:43:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 16:43:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 16:43:28,028 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 16:43:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:28,065 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-19 16:43:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 16:43:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-19 16:43:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:28,072 INFO L225 Difference]: With dead ends: 54 [2024-11-19 16:43:28,072 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 16:43:28,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 16:43:28,079 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:28,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 16:43:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-19 16:43:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-19 16:43:28,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-19 16:43:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:28,114 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-19 16:43:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 16:43:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-19 16:43:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 16:43:28,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:28,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:28,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 16:43:28,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-19 16:43:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203938072] [2024-11-19 16:43:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 16:43:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 16:43:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 16:43:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 16:43:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203938072] [2024-11-19 16:43:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203938072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546305794] [2024-11-19 16:43:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:28,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:28,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:28,306 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-11-19 16:43:28,307 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-11-19 16:43:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 16:43:28,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 16:43:28,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 16:43:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546305794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 16:43:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 16:43:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 16:43:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132777126] [2024-11-19 16:43:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 16:43:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 16:43:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 16:43:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 16:43:28,407 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:28,421 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-19 16:43:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 16:43:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-19 16:43:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:28,423 INFO L225 Difference]: With dead ends: 46 [2024-11-19 16:43:28,423 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 16:43:28,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 16:43:28,424 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:28,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 16:43:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-19 16:43:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-19 16:43:28,429 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-19 16:43:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-19 16:43:28,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-19 16:43:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 16:43:28,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:28,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:28,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 16:43:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:28,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:28,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-19 16:43:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:28,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763013137] [2024-11-19 16:43:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 16:43:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 16:43:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 16:43:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 16:43:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763013137] [2024-11-19 16:43:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763013137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130323773] [2024-11-19 16:43:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:28,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:28,772 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-11-19 16:43:28,774 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-11-19 16:43:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:28,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 16:43:28,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 16:43:28,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 16:43:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130323773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 16:43:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 16:43:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 16:43:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313823895] [2024-11-19 16:43:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 16:43:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 16:43:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 16:43:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:28,868 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:28,884 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-19 16:43:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 16:43:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-19 16:43:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:28,888 INFO L225 Difference]: With dead ends: 44 [2024-11-19 16:43:28,888 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 16:43:28,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:28,890 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:28,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 16:43:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-19 16:43:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-19 16:43:28,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-19 16:43:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:28,900 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-19 16:43:28,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-19 16:43:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 16:43:28,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:28,902 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:28,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 16:43:29,103 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,SelfDestructingSolverStorable2 [2024-11-19 16:43:29,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:29,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-19 16:43:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848922668] [2024-11-19 16:43:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 16:43:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 16:43:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 16:43:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 16:43:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848922668] [2024-11-19 16:43:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848922668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609980741] [2024-11-19 16:43:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:29,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:29,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:29,204 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-11-19 16:43:29,205 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-11-19 16:43:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 16:43:29,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 16:43:29,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 16:43:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609980741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 16:43:29,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 16:43:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 16:43:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801703514] [2024-11-19 16:43:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 16:43:29,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 16:43:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 16:43:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:29,295 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:29,305 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-19 16:43:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 16:43:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-19 16:43:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:29,307 INFO L225 Difference]: With dead ends: 53 [2024-11-19 16:43:29,308 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 16:43:29,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:29,309 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:29,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 16:43:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 16:43:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-19 16:43:29,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-19 16:43:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:29,316 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-19 16:43:29,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 16:43:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-19 16:43:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 16:43:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:29,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:29,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 16:43:29,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:29,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:29,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-19 16:43:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:29,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000490203] [2024-11-19 16:43:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 16:43:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 16:43:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 16:43:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 16:43:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000490203] [2024-11-19 16:43:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000490203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962611368] [2024-11-19 16:43:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:29,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:29,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:29,595 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-11-19 16:43:29,596 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-11-19 16:43:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:29,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 16:43:29,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 16:43:29,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 16:43:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 16:43:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962611368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 16:43:29,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 16:43:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-19 16:43:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255984209] [2024-11-19 16:43:29,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 16:43:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 16:43:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:29,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 16:43:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 16:43:29,727 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 16:43:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:29,797 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-19 16:43:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 16:43:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-19 16:43:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:29,798 INFO L225 Difference]: With dead ends: 69 [2024-11-19 16:43:29,798 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 16:43:29,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 16:43:29,799 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:29,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 16:43:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 16:43:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-19 16:43:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-19 16:43:29,803 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-11-19 16:43:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:29,803 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-19 16:43:29,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 16:43:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-19 16:43:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 16:43:29,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:29,805 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:29,811 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-11-19 16:43:30,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:30,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:30,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2024-11-19 16:43:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068847265] [2024-11-19 16:43:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 16:43:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 16:43:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 16:43:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-19 16:43:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068847265] [2024-11-19 16:43:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068847265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:30,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530517353] [2024-11-19 16:43:30,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 16:43:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:30,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 16:43:30,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 16:43:30,130 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 16:43:30,130 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 16:43:30,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 16:43:30,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-19 16:43:30,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 16:43:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-19 16:43:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530517353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 16:43:30,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 16:43:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2024-11-19 16:43:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966450183] [2024-11-19 16:43:30,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 16:43:30,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 16:43:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 16:43:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 16:43:30,225 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:30,256 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2024-11-19 16:43:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 16:43:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-19 16:43:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:30,258 INFO L225 Difference]: With dead ends: 76 [2024-11-19 16:43:30,258 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 16:43:30,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 16:43:30,259 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:30,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 16:43:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-19 16:43:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-19 16:43:30,263 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 57 [2024-11-19 16:43:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-19 16:43:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-19 16:43:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 16:43:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:30,267 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:30,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 16:43:30,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:30,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -878735508, now seen corresponding path program 1 times [2024-11-19 16:43:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259876827] [2024-11-19 16:43:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 16:43:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 16:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 16:43:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-11-19 16:43:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259876827] [2024-11-19 16:43:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259876827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749158867] [2024-11-19 16:43:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:30,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:30,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:30,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 16:43:30,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 16:43:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:30,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 16:43:30,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-19 16:43:30,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 16:43:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-19 16:43:30,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749158867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 16:43:30,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 16:43:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-11-19 16:43:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414808956] [2024-11-19 16:43:30,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 16:43:30,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 16:43:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 16:43:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:30,717 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:30,746 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2024-11-19 16:43:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 16:43:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-19 16:43:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:30,747 INFO L225 Difference]: With dead ends: 73 [2024-11-19 16:43:30,747 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 16:43:30,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:30,748 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:30,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 16:43:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-19 16:43:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-19 16:43:30,752 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 68 [2024-11-19 16:43:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:30,753 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-19 16:43:30,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-19 16:43:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 16:43:30,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:30,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:30,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 16:43:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:30,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1640193017, now seen corresponding path program 2 times [2024-11-19 16:43:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:30,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894150186] [2024-11-19 16:43:30,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 16:43:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 16:43:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 16:43:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-19 16:43:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894150186] [2024-11-19 16:43:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894150186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344542500] [2024-11-19 16:43:31,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 16:43:31,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:31,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:31,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 16:43:31,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 16:43:31,137 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 16:43:31,137 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 16:43:31,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 16:43:31,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-19 16:43:31,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 16:43:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 16:43:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344542500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 16:43:31,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 16:43:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 10 [2024-11-19 16:43:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88479045] [2024-11-19 16:43:31,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 16:43:31,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 16:43:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 16:43:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 16:43:31,249 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:31,287 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2024-11-19 16:43:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 16:43:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2024-11-19 16:43:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:31,289 INFO L225 Difference]: With dead ends: 83 [2024-11-19 16:43:31,290 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 16:43:31,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 16:43:31,290 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:31,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 16:43:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-19 16:43:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-19 16:43:31,299 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 79 [2024-11-19 16:43:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:31,300 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-19 16:43:31,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 16:43:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-19 16:43:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 16:43:31,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:31,301 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:31,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 16:43:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:31,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1512971690, now seen corresponding path program 3 times [2024-11-19 16:43:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738484449] [2024-11-19 16:43:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 16:43:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 16:43:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 16:43:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 16:43:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-19 16:43:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 16:43:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738484449] [2024-11-19 16:43:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738484449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 16:43:31,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643871573] [2024-11-19 16:43:31,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 16:43:31,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:31,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 16:43:31,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 16:43:31,698 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 16:43:31,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 16:43:31,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 16:43:31,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 16:43:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 16:43:31,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 16:43:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-19 16:43:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643871573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 16:43:31,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 16:43:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 16:43:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984188058] [2024-11-19 16:43:31,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 16:43:31,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 16:43:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 16:43:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 16:43:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:31,756 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 16:43:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 16:43:31,773 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-11-19 16:43:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 16:43:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-11-19 16:43:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 16:43:31,774 INFO L225 Difference]: With dead ends: 79 [2024-11-19 16:43:31,774 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 16:43:31,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 181 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 16:43:31,775 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 16:43:31,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 16:43:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 16:43:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 16:43:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 16:43:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-11-19 16:43:31,779 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 90 [2024-11-19 16:43:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 16:43:31,779 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-19 16:43:31,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 16:43:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-11-19 16:43:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 16:43:31,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 16:43:31,780 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 16:43:31,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 16:43:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 16:43:31,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 16:43:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 16:43:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1193894376, now seen corresponding path program 4 times [2024-11-19 16:43:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 16:43:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836885161] [2024-11-19 16:43:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 16:43:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 16:43:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 16:43:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332207162] [2024-11-19 16:43:32,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 16:43:32,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 16:43:32,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 16:43:32,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 16:43:32,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 16:43:32,212 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 16:43:32,212 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 16:43:32,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 16:43:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 16:43:32,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 16:43:32,393 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 16:43:32,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 16:43:32,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 16:43:32,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 16:43:32,598 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2024-11-19 16:43:32,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 16:43:32,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:43:32 BoogieIcfgContainer [2024-11-19 16:43:32,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 16:43:32,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 16:43:32,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 16:43:32,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 16:43:32,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:43:27" (3/4) ... [2024-11-19 16:43:32,664 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 16:43:32,727 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 16:43:32,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 16:43:32,727 INFO L158 Benchmark]: Toolchain (without parser) took 5665.33ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 107.3MB in the beginning and 179.3MB in the end (delta: -72.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 16:43:32,727 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 16:43:32,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.72ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 16:43:32,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 16:43:32,728 INFO L158 Benchmark]: Boogie Preprocessor took 27.94ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 16:43:32,728 INFO L158 Benchmark]: RCFGBuilder took 284.78ms. Allocated memory is still 165.7MB. Free memory was 90.7MB in the beginning and 76.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 16:43:32,728 INFO L158 Benchmark]: TraceAbstraction took 5060.33ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 76.0MB in the beginning and 184.5MB in the end (delta: -108.5MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-11-19 16:43:32,728 INFO L158 Benchmark]: Witness Printer took 63.46ms. Allocated memory is still 222.3MB. Free memory was 184.5MB in the beginning and 179.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 16:43:32,729 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.13ms. Allocated memory is still 165.7MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.72ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.94ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.78ms. Allocated memory is still 165.7MB. Free memory was 90.7MB in the beginning and 76.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5060.33ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 76.0MB in the beginning and 184.5MB in the end (delta: -108.5MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * Witness Printer took 63.46ms. Allocated memory is still 222.3MB. Free memory was 184.5MB in the beginning and 179.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND FALSE !(i < 5) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-2, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-2, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-2, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-2, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-1, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-1, ret=-1, temp=-7, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-1, ret=-1, temp=-7, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-1, ret=-1, temp=-7, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-1, ret=-1, temp=-7, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-1, ret=-1, temp=-7, x={3:0}] [L54] COND FALSE !(i<5 -1) VAL [ret2=-1, ret=-1, temp=-7, x={3:0}] [L57] x[5 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=1, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=1, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-6, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-6, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-6, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-1, ret=-1, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 651 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 241 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 874 GetRequests, 812 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, InterpolantAutomatonStates: 52, 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, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 2769/3164 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 16:43:32,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE