./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/ldv-regression/stateful_check.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:17:21,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:17:21,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:17:21,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:17:21,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:17:21,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:17:21,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:17:21,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:17:21,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:17:21,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:17:21,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:17:21,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:17:21,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:17:21,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:17:21,931 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:17:21,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:17:21,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:17:21,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:17:21,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:17:21,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:17:21,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:17:21,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:17:21,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:17:21,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:17:21,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:17:21,935 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:17:21,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:17:21,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:17:21,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:17:21,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:17:21,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:17:21,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:17:21,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:17:21,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:17:21,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:17:21,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:17:21,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:17:21,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:17:21,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:17:21,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:17:21,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:17:21,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:17:21,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:17:21,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:17:21,941 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 ! overflow) ) 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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2024-11-19 10:17:22,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:17:22,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:17:22,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:17:22,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:17:22,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:17:22,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2024-11-19 10:17:23,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:17:23,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:17:23,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2024-11-19 10:17:23,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311743e9d/295d0f3a94d64a8db5c1290f186b3203/FLAGbd09d3b2a [2024-11-19 10:17:23,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311743e9d/295d0f3a94d64a8db5c1290f186b3203 [2024-11-19 10:17:23,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:17:23,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:17:23,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:17:23,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:17:23,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:17:23,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee1f1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23, skipping insertion in model container [2024-11-19 10:17:23,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:17:23,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:17:23,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:17:23,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:17:23,804 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:17:23,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23 WrapperNode [2024-11-19 10:17:23,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:17:23,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:17:23,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:17:23,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:17:23,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,828 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 114 [2024-11-19 10:17:23,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:17:23,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:17:23,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:17:23,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:17:23,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 10:17:23,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:17:23,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:17:23,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:17:23,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:17:23,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (1/1) ... [2024-11-19 10:17:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:17:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:17:23,924 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 10:17:23,926 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 10:17:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:17:23,962 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-11-19 10:17:23,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-11-19 10:17:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:17:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-19 10:17:23,963 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-19 10:17:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:17:23,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:17:24,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:17:24,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:17:24,133 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-19 10:17:24,134 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:17:24,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:17:24,144 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:17:24,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:24 BoogieIcfgContainer [2024-11-19 10:17:24,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:17:24,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:17:24,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:17:24,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:17:24,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:17:23" (1/3) ... [2024-11-19 10:17:24,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba481b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:24, skipping insertion in model container [2024-11-19 10:17:24,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:23" (2/3) ... [2024-11-19 10:17:24,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba481b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:24, skipping insertion in model container [2024-11-19 10:17:24,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:24" (3/3) ... [2024-11-19 10:17:24,150 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2024-11-19 10:17:24,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:17:24,161 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 10:17:24,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:17:24,205 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;@5fc1550a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:17:24,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 10:17:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 53 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:17:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:17:24,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:24,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:24,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1329387042, now seen corresponding path program 1 times [2024-11-19 10:17:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241786748] [2024-11-19 10:17:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241786748] [2024-11-19 10:17:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241786748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930974480] [2024-11-19 10:17:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:24,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:17:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:17:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:24,422 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 53 states have internal predecessors, (65), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:24,487 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2024-11-19 10:17:24,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:17:24,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 10:17:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:24,495 INFO L225 Difference]: With dead ends: 127 [2024-11-19 10:17:24,495 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:17:24,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:24,500 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:24,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 115 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:17:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 10:17:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 53 states have internal predecessors, (69), 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 10:17:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-19 10:17:24,543 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 10 [2024-11-19 10:17:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:24,543 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-19 10:17:24,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-19 10:17:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:17:24,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:24,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:24,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:17:24,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:24,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1311255311, now seen corresponding path program 1 times [2024-11-19 10:17:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323546570] [2024-11-19 10:17:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323546570] [2024-11-19 10:17:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323546570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:24,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657748225] [2024-11-19 10:17:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:24,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:24,721 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:24,755 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-11-19 10:17:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:24,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 10:17:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:24,756 INFO L225 Difference]: With dead ends: 57 [2024-11-19 10:17:24,756 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 10:17:24,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:24,758 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:24,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 10:17:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 10:17:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.425531914893617) internal successors, (67), 51 states have internal predecessors, (67), 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 10:17:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-11-19 10:17:24,766 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 10 [2024-11-19 10:17:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:24,766 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-11-19 10:17:24,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-19 10:17:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:17:24,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:24,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:24,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:17:24,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1122697232, now seen corresponding path program 1 times [2024-11-19 10:17:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134937711] [2024-11-19 10:17:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:17:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134937711] [2024-11-19 10:17:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134937711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:24,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373507649] [2024-11-19 10:17:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:24,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:24,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:24,857 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:24,914 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2024-11-19 10:17:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 10:17:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:24,917 INFO L225 Difference]: With dead ends: 118 [2024-11-19 10:17:24,917 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 10:17:24,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:24,918 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:24,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 10:17:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 10:17:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 62 states have internal predecessors, (86), 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 10:17:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-19 10:17:24,929 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 19 [2024-11-19 10:17:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:24,930 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-19 10:17:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-19 10:17:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:17:24,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:24,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:17:24,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 457237178, now seen corresponding path program 1 times [2024-11-19 10:17:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293355757] [2024-11-19 10:17:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293355757] [2024-11-19 10:17:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293355757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:17:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565397323] [2024-11-19 10:17:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:17:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:17:25,010 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 10:17:25,012 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 10:17:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:25,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:17:25,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:17:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:25,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:17:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565397323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:17:25,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:17:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 10:17:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636227088] [2024-11-19 10:17:25,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:17:25,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:17:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:17:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:17:25,175 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:25,224 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2024-11-19 10:17:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:17:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 10:17:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:25,226 INFO L225 Difference]: With dead ends: 153 [2024-11-19 10:17:25,226 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 10:17:25,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:17:25,228 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:25,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 10:17:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 10:17:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 86 states have internal predecessors, (123), 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 10:17:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-19 10:17:25,235 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 20 [2024-11-19 10:17:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-19 10:17:25,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-19 10:17:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:17:25,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:25,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:25,250 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 10:17:25,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:17:25,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:25,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 443875915, now seen corresponding path program 1 times [2024-11-19 10:17:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101786121] [2024-11-19 10:17:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:17:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101786121] [2024-11-19 10:17:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101786121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:25,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:25,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576339520] [2024-11-19 10:17:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:25,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,483 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:25,516 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2024-11-19 10:17:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 10:17:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:25,517 INFO L225 Difference]: With dead ends: 90 [2024-11-19 10:17:25,517 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 10:17:25,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,518 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:25,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 10:17:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 10:17:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 85 states have internal predecessors, (122), 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 10:17:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-19 10:17:25,534 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 20 [2024-11-19 10:17:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-19 10:17:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-19 10:17:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:17:25,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:25,535 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:17:25,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1677546102, now seen corresponding path program 1 times [2024-11-19 10:17:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004781940] [2024-11-19 10:17:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:17:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:25,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004781940] [2024-11-19 10:17:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004781940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:25,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183397078] [2024-11-19 10:17:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,623 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:25,661 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2024-11-19 10:17:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:25,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 10:17:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:25,662 INFO L225 Difference]: With dead ends: 174 [2024-11-19 10:17:25,663 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 10:17:25,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,664 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:25,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 10:17:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 10:17:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 84 states have internal predecessors, (119), 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 10:17:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-11-19 10:17:25,674 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 29 [2024-11-19 10:17:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:25,675 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-11-19 10:17:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-11-19 10:17:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 10:17:25,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:25,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:25,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:17:25,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 10:17:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash -464321502, now seen corresponding path program 1 times [2024-11-19 10:17:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:25,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23188931] [2024-11-19 10:17:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:17:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23188931] [2024-11-19 10:17:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23188931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:25,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267578604] [2024-11-19 10:17:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:25,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,734 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:25,767 INFO L93 Difference]: Finished difference Result 88 states and 125 transitions. [2024-11-19 10:17:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 10:17:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:25,768 INFO L225 Difference]: With dead ends: 88 [2024-11-19 10:17:25,768 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:17:25,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:25,769 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:25,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:17:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:17:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:17:25,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-19 10:17:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:25,771 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:17:25,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:17:25,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:17:25,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 10:17:25,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 10:17:25,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 10:17:25,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 10:17:25,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 10:17:25,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 10:17:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:17:25,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:25,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:17:25,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:17:25,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:17:25 BoogieIcfgContainer [2024-11-19 10:17:25,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:17:25,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:17:25,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:17:25,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:17:25,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:24" (3/4) ... [2024-11-19 10:17:25,828 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:17:25,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2024-11-19 10:17:25,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2024-11-19 10:17:25,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-19 10:17:25,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:17:25,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:17:25,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:17:25,910 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:17:25,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:17:25,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:17:25,913 INFO L158 Benchmark]: Toolchain (without parser) took 2284.68ms. Allocated memory was 176.2MB in the beginning and 302.0MB in the end (delta: 125.8MB). Free memory was 102.6MB in the beginning and 174.3MB in the end (delta: -71.7MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,913 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:17:25,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.70ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 88.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.59ms. Allocated memory is still 176.2MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,914 INFO L158 Benchmark]: Boogie Preprocessor took 59.56ms. Allocated memory is still 176.2MB. Free memory was 87.2MB in the beginning and 144.3MB in the end (delta: -57.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,914 INFO L158 Benchmark]: RCFGBuilder took 256.07ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 133.0MB in the end (delta: 11.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,915 INFO L158 Benchmark]: TraceAbstraction took 1679.12ms. Allocated memory was 176.2MB in the beginning and 302.0MB in the end (delta: 125.8MB). Free memory was 132.0MB in the beginning and 179.6MB in the end (delta: -47.6MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,915 INFO L158 Benchmark]: Witness Printer took 87.30ms. Allocated memory is still 302.0MB. Free memory was 179.6MB in the beginning and 174.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:17:25,916 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.70ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 88.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.59ms. Allocated memory is still 176.2MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.56ms. Allocated memory is still 176.2MB. Free memory was 87.2MB in the beginning and 144.3MB in the end (delta: -57.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 256.07ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 133.0MB in the end (delta: 11.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1679.12ms. Allocated memory was 176.2MB in the beginning and 302.0MB in the end (delta: 125.8MB). Free memory was 132.0MB in the beginning and 179.6MB in the end (delta: -47.6MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Witness Printer took 87.30ms. Allocated memory is still 302.0MB. Free memory was 179.6MB in the beginning and 174.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 982 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 609 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 373 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 28/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for mutex_lock Derived contract for procedure mutex_lock. Ensures: (open_called == \old(open_called)) - ProcedureContractResult [Line: 5]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert. Ensures: (0 && ((ldv_mutex == \old(ldv_mutex)) && (open_called == \old(open_called)))) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:17:25,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE