./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 14d2c3c15a60b4893aeff23e67be25cf47c84a4d80762cb924c873e6aa2aa4d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:35:39,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:35:39,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:35:39,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:35:39,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:35:39,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:35:39,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:35:39,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:35:39,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:35:39,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:35:39,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:35:39,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:35:39,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:35:39,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:35:39,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:35:39,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:35:39,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:35:39,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:35:39,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:35:39,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:35:39,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:35:39,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:35:39,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:35:39,683 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:35:39,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:35:39,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:35:39,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:35:39,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:35:39,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:35:39,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:35:39,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:35:39,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:35:39,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:35:39,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:35:39,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:35:39,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:35:39,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:35:39,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:35:39,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:35:39,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:35:39,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:35:39,690 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14d2c3c15a60b4893aeff23e67be25cf47c84a4d80762cb924c873e6aa2aa4d9 [2024-11-19 12:35:39,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:35:39,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:35:39,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:35:40,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:35:40,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:35:40,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:41,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:35:41,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:35:41,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:41,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d24ad64c/07d00a0e0024424c94c2080ec6be46da/FLAG1c29d7bed [2024-11-19 12:35:42,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d24ad64c/07d00a0e0024424c94c2080ec6be46da [2024-11-19 12:35:42,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:35:42,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:35:42,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:35:42,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:35:42,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:35:42,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:42" (1/1) ... [2024-11-19 12:35:42,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70951a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:42, skipping insertion in model container [2024-11-19 12:35:42,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:42" (1/1) ... [2024-11-19 12:35:42,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:35:42,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:35:42,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:35:42,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:35:43,049 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:35:43,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43 WrapperNode [2024-11-19 12:35:43,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:35:43,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:35:43,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:35:43,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:35:43,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,116 INFO L138 Inliner]: procedures = 499, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2024-11-19 12:35:43,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:35:43,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:35:43,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:35:43,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:35:43,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,143 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:35:43,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:35:43,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:35:43,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:35:43,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:35:43,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (1/1) ... [2024-11-19 12:35:43,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:35:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:35:43,208 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 12:35:43,214 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 12:35:43,260 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:35:43,260 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:35:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:35:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:35:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:35:43,261 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-19 12:35:43,261 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-19 12:35:43,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:35:43,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:35:43,636 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-19 12:35:43,636 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:35:43,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:35:43,647 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:35:43,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:43 BoogieIcfgContainer [2024-11-19 12:35:43,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:35:43,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:35:43,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:35:43,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:35:43,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:42" (1/3) ... [2024-11-19 12:35:43,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3a7fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:43, skipping insertion in model container [2024-11-19 12:35:43,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:43" (2/3) ... [2024-11-19 12:35:43,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3a7fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:43, skipping insertion in model container [2024-11-19 12:35:43,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:43" (3/3) ... [2024-11-19 12:35:43,656 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:43,689 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:35:43,689 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:35:43,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:35:43,748 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;@3ab73376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:35:43,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:35:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 12:35:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 12:35:43,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:43,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:35:43,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1648115636, now seen corresponding path program 1 times [2024-11-19 12:35:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:35:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766769240] [2024-11-19 12:35:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:35:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 12:35:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:35:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766769240] [2024-11-19 12:35:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766769240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 12:35:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082453356] [2024-11-19 12:35:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:44,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 12:35:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:35:44,089 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 12:35:44,090 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 12:35:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:44,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:35:44,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:35:44,223 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 12:35:44,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:35:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082453356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:35:44,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 12:35:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 12:35:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140004181] [2024-11-19 12:35:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:35:44,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:35:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:35:44,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:35:44,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 12:35:44,259 INFO L87 Difference]: Start difference. First operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:35:44,296 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-19 12:35:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:35:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-19 12:35:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:35:44,308 INFO L225 Difference]: With dead ends: 57 [2024-11-19 12:35:44,308 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 12:35:44,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 12:35:44,317 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:35:44,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:35:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 12:35:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-19 12:35:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 12:35:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-11-19 12:35:44,355 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 21 [2024-11-19 12:35:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:35:44,358 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-11-19 12:35:44,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-11-19 12:35:44,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 12:35:44,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:44,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:35:44,379 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 12:35:44,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 12:35:44,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -448022698, now seen corresponding path program 1 times [2024-11-19 12:35:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:35:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176842950] [2024-11-19 12:35:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:35:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 12:35:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:35:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176842950] [2024-11-19 12:35:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176842950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 12:35:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737710148] [2024-11-19 12:35:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:44,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 12:35:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:35:44,665 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 12:35:44,667 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 12:35:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:44,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:35:44,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:35:44,769 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 12:35:44,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:35:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737710148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:35:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 12:35:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 12:35:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841380691] [2024-11-19 12:35:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:35:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:35:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:35:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:35:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 12:35:44,772 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:35:44,788 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-19 12:35:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:35:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-19 12:35:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:35:44,789 INFO L225 Difference]: With dead ends: 49 [2024-11-19 12:35:44,790 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 12:35:44,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 12:35:44,791 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 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 12:35:44,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:35:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 12:35:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-19 12:35:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:35:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-19 12:35:44,799 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 22 [2024-11-19 12:35:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:35:44,799 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-19 12:35:44,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-19 12:35:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 12:35:44,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:44,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:35:44,819 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 12:35:45,003 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,SelfDestructingSolverStorable1 [2024-11-19 12:35:45,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:45,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 10447351, now seen corresponding path program 1 times [2024-11-19 12:35:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:35:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915739814] [2024-11-19 12:35:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:35:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:45,169 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 12:35:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:35:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915739814] [2024-11-19 12:35:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915739814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:35:45,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:35:45,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 12:35:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820147431] [2024-11-19 12:35:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:35:45,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:35:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:35:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:35:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:35:45,174 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:35:45,191 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-19 12:35:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:35:45,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-19 12:35:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:35:45,194 INFO L225 Difference]: With dead ends: 43 [2024-11-19 12:35:45,195 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 12:35:45,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:35:45,196 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:35:45,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:35:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 12:35:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 12:35:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:35:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-19 12:35:45,207 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 27 [2024-11-19 12:35:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:35:45,208 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-19 12:35:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-19 12:35:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 12:35:45,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:45,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:35:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 12:35:45,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 323868019, now seen corresponding path program 1 times [2024-11-19 12:35:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:35:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867644537] [2024-11-19 12:35:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:35:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:35:45,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:35:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:35:45,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 12:35:45,299 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:35:45,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:35:45,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:35:45,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 12:35:45,310 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 12:35:45,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:35:45,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:45 BoogieIcfgContainer [2024-11-19 12:35:45,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:35:45,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:35:45,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:35:45,348 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:35:45,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:43" (3/4) ... [2024-11-19 12:35:45,350 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:35:45,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:35:45,352 INFO L158 Benchmark]: Toolchain (without parser) took 3302.40ms. Allocated memory is still 180.4MB. Free memory was 143.1MB in the beginning and 66.7MB in the end (delta: 76.4MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-11-19 12:35:45,353 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:45,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 999.30ms. Allocated memory is still 180.4MB. Free memory was 143.1MB in the beginning and 76.3MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-19 12:35:45,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.63ms. Allocated memory is still 180.4MB. Free memory was 76.3MB in the beginning and 73.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:35:45,354 INFO L158 Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 180.4MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:35:45,354 INFO L158 Benchmark]: RCFGBuilder took 484.59ms. Allocated memory is still 180.4MB. Free memory was 70.8MB in the beginning and 54.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 12:35:45,355 INFO L158 Benchmark]: TraceAbstraction took 1697.37ms. Allocated memory is still 180.4MB. Free memory was 53.2MB in the beginning and 66.7MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:45,356 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 180.4MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:45,357 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.18ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 999.30ms. Allocated memory is still 180.4MB. Free memory was 143.1MB in the beginning and 76.3MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.63ms. Allocated memory is still 180.4MB. Free memory was 76.3MB in the beginning and 73.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.21ms. Allocated memory is still 180.4MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.59ms. Allocated memory is still 180.4MB. Free memory was 70.8MB in the beginning and 54.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1697.37ms. Allocated memory is still 180.4MB. Free memory was 53.2MB in the beginning and 66.7MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 180.4MB. Free memory is still 66.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1576. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1576] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1577] CALL CWE190_Integer_Overflow__int_rand_preinc_08_bad() [L1558] int data; [L1559] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1567] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 179 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 11/15 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 could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:35:45,386 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 14d2c3c15a60b4893aeff23e67be25cf47c84a4d80762cb924c873e6aa2aa4d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:35:47,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:35:47,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:35:47,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:35:47,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:35:47,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:35:47,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:35:47,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:35:47,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:35:47,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:35:47,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:35:47,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:35:47,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:35:47,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:35:47,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:35:47,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:35:47,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:35:47,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:35:47,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:35:47,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:35:47,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:35:47,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:35:47,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:35:47,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:35:47,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:35:47,669 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:35:47,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:35:47,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:35:47,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:35:47,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:35:47,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:35:47,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:35:47,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:35:47,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:35:47,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:35:47,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:35:47,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:35:47,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:35:47,676 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:35:47,677 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:35:47,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:35:47,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:35:47,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:35:47,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:35:47,678 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14d2c3c15a60b4893aeff23e67be25cf47c84a4d80762cb924c873e6aa2aa4d9 [2024-11-19 12:35:47,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:35:48,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:35:48,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:35:48,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:35:48,016 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:35:48,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:49,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:35:49,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:35:49,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:49,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ca1ac1/5622c27585434ec6932be5202c3a4dae/FLAGb888a8238 [2024-11-19 12:35:50,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ca1ac1/5622c27585434ec6932be5202c3a4dae [2024-11-19 12:35:50,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:35:50,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:35:50,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:35:50,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:35:50,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:35:50,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:50" (1/1) ... [2024-11-19 12:35:50,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132104b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:50, skipping insertion in model container [2024-11-19 12:35:50,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:50" (1/1) ... [2024-11-19 12:35:50,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:35:51,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:35:51,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:35:51,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:35:51,418 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:35:51,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51 WrapperNode [2024-11-19 12:35:51,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:35:51,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:35:51,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:35:51,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:35:51,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,482 INFO L138 Inliner]: procedures = 504, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-19 12:35:51,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:35:51,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:35:51,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:35:51,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:35:51,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,513 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 12:35:51,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:35:51,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:35:51,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:35:51,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:35:51,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (1/1) ... [2024-11-19 12:35:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:35:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:35:51,584 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 12:35:51,587 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 12:35:51,628 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:35:51,629 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:35:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:35:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:35:51,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:35:51,629 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-11-19 12:35:51,629 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-11-19 12:35:51,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:35:51,769 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:35:51,934 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-19 12:35:51,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:35:51,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:35:51,948 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 12:35:51,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:51 BoogieIcfgContainer [2024-11-19 12:35:51,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:35:51,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:35:51,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:35:51,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:35:51,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:50" (1/3) ... [2024-11-19 12:35:51,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ea10ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:51, skipping insertion in model container [2024-11-19 12:35:51,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:51" (2/3) ... [2024-11-19 12:35:51,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ea10ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:51, skipping insertion in model container [2024-11-19 12:35:51,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:51" (3/3) ... [2024-11-19 12:35:51,959 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_08_bad.i [2024-11-19 12:35:51,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:35:51,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 12:35:52,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:35:52,048 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;@2feb2d38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:35:52,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 12:35:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 12:35:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 12:35:52,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:52,065 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 12:35:52,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:52,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -894708504, now seen corresponding path program 1 times [2024-11-19 12:35:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:35:52,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902215698] [2024-11-19 12:35:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:52,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:35:52,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:35:52,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 12:35:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:52,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 12:35:52,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:35:52,250 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 12:35:52,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:35:52,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:35:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902215698] [2024-11-19 12:35:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902215698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:35:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:35:52,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 12:35:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198866435] [2024-11-19 12:35:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:35:52,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 12:35:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:35:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 12:35:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:35:52,280 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 12:35:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:35:52,297 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-19 12:35:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 12:35:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 19 [2024-11-19 12:35:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:35:52,306 INFO L225 Difference]: With dead ends: 28 [2024-11-19 12:35:52,306 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 12:35:52,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:35:52,311 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:35:52,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:35:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 12:35:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 12:35:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:35:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-19 12:35:52,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 19 [2024-11-19 12:35:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:35:52,342 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 12:35:52,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 12:35:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-19 12:35:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 12:35:52,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:52,343 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 12:35:52,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 12:35:52,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:52,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:52,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1966159784, now seen corresponding path program 1 times [2024-11-19 12:35:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:35:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472015147] [2024-11-19 12:35:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:52,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:52,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:35:52,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:35:52,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 12:35:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:35:52,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:35:52,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:35:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:35:52,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:35:52,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:35:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472015147] [2024-11-19 12:35:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472015147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:35:52,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:35:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 12:35:52,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041625206] [2024-11-19 12:35:52,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:35:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:35:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:35:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:35:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:35:52,707 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:35:52,719 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-19 12:35:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:35:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-19 12:35:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:35:52,720 INFO L225 Difference]: With dead ends: 28 [2024-11-19 12:35:52,720 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 12:35:52,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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 12:35:52,722 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:35:52,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:35:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 12:35:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 12:35:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:35:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-19 12:35:52,729 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 20 [2024-11-19 12:35:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:35:52,729 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 12:35:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 12:35:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-19 12:35:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 12:35:52,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:35:52,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:35:52,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 12:35:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:52,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-19 12:35:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:35:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash 119673117, now seen corresponding path program 1 times [2024-11-19 12:35:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:35:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664433551] [2024-11-19 12:35:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:35:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:35:52,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:35:52,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 12:35:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:35:53,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:35:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:35:53,094 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 12:35:53,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:35:53,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-19 12:35:53,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-19 12:35:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 12:35:53,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:35:53,302 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 12:35:53,336 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:35:53,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:53 BoogieIcfgContainer [2024-11-19 12:35:53,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:35:53,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:35:53,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:35:53,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:35:53,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:51" (3/4) ... [2024-11-19 12:35:53,347 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:35:53,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:35:53,349 INFO L158 Benchmark]: Toolchain (without parser) took 3197.81ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.6MB in the beginning and 69.0MB in the end (delta: -27.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:53,350 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 81.8MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:53,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1266.53ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.3MB in the beginning and 66.5MB in the end (delta: -25.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-19 12:35:53,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.21ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:35:53,353 INFO L158 Benchmark]: Boogie Preprocessor took 62.05ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:35:53,354 INFO L158 Benchmark]: RCFGBuilder took 403.08ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 46.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 12:35:53,354 INFO L158 Benchmark]: TraceAbstraction took 1391.40ms. Allocated memory is still 100.7MB. Free memory was 45.6MB in the beginning and 69.7MB in the end (delta: -24.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-19 12:35:53,355 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 69.0MB in the end (delta: 650.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:35:53,356 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.42ms. Allocated memory is still 81.8MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1266.53ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 41.3MB in the beginning and 66.5MB in the end (delta: -25.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.21ms. Allocated memory is still 100.7MB. Free memory was 66.5MB in the beginning and 63.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.05ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.08ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 46.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1391.40ms. Allocated memory is still 100.7MB. Free memory was 45.6MB in the beginning and 69.7MB in the end (delta: -24.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 69.0MB in the end (delta: 650.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1576. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1576] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1576] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1577] CALL CWE190_Integer_Overflow__int_rand_preinc_08_bad() [L1558] int data; [L1559] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE staticReturnsTrue() [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1562] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1562] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1564] CALL staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1550] return 1; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \result=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] RET staticReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1564] COND TRUE staticReturnsTrue() [L1567] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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 could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:35:53,389 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: UNKNOWN: Overapproximated counterexample