./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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_multiply_07_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 d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:13:04,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:13:04,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 19:13:04,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:13:04,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:13:04,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:13:04,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:13:04,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:13:04,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:13:04,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:13:04,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:13:04,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:13:04,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:13:04,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:13:04,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:13:04,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:13:04,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:13:04,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 19:13:04,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:13:04,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:13:04,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:13:04,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:13:04,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:13:04,166 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:13:04,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:13:04,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:13:04,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:13:04,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:13:04,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:13:04,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:13:04,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:13:04,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:04,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:13:04,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:13:04,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:13:04,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 19:13:04,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 19:13:04,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:13:04,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:13:04,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:13:04,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:13:04,174 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 -> d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 [2024-11-12 19:13:04,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:13:04,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:13:04,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:13:04,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:13:04,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:13:04,461 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_multiply_07_bad.i [2024-11-12 19:13:05,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:13:06,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:13:06,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-12 19:13:06,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6261cf9/3ffbeedb39a24f5d88736faab37ddca0/FLAGfc8baec9a [2024-11-12 19:13:06,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6261cf9/3ffbeedb39a24f5d88736faab37ddca0 [2024-11-12 19:13:06,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:13:06,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:13:06,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:06,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:13:06,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:13:06,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:06" (1/1) ... [2024-11-12 19:13:06,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f1e915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:06, skipping insertion in model container [2024-11-12 19:13:06,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:06" (1/1) ... [2024-11-12 19:13:06,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:13:07,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:07,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:13:07,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:07,363 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:13:07,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07 WrapperNode [2024-11-12 19:13:07,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:07,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:07,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:13:07,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:13:07,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,430 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-11-12 19:13:07,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:07,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:13:07,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:13:07,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:13:07,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,456 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:13:07,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:13:07,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:13:07,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:13:07,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:13:07,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (1/1) ... [2024-11-12 19:13:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:07,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:13:07,500 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-12 19:13:07,507 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-12 19:13:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:13:07,546 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:13:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:13:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:13:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:13:07,683 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:13:07,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:13:07,833 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-12 19:13:07,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:13:07,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:13:07,847 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:13:07,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:07 BoogieIcfgContainer [2024-11-12 19:13:07,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:13:07,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:13:07,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:13:07,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:13:07,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:13:06" (1/3) ... [2024-11-12 19:13:07,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5795cb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:07, skipping insertion in model container [2024-11-12 19:13:07,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:07" (2/3) ... [2024-11-12 19:13:07,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5795cb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:07, skipping insertion in model container [2024-11-12 19:13:07,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:07" (3/3) ... [2024-11-12 19:13:07,861 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-12 19:13:07,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:13:07,878 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:13:07,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:13:07,934 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;@90f6f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:13:07,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:13:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5) internal successors, (57), 40 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:13:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 19:13:07,944 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:07,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:07,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:07,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash -458714749, now seen corresponding path program 1 times [2024-11-12 19:13:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834413653] [2024-11-12 19:13:07,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834413653] [2024-11-12 19:13:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834413653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:13:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495127667] [2024-11-12 19:13:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:08,234 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5) internal successors, (57), 40 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:08,280 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-12 19:13:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:08,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 19:13:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:08,287 INFO L225 Difference]: With dead ends: 61 [2024-11-12 19:13:08,288 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 19:13:08,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 19:13:08,308 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:08,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 19:13:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 19:13:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 19:13:08,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 12 [2024-11-12 19:13:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 19:13:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 19:13:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 19:13:08,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:08,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 19:13:08,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1766449670, now seen corresponding path program 1 times [2024-11-12 19:13:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584121404] [2024-11-12 19:13:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:08,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:13:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:13:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584121404] [2024-11-12 19:13:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584121404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:13:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273254022] [2024-11-12 19:13:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:08,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:08,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:13:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:08,470 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:08,487 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-11-12 19:13:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-12 19:13:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:08,488 INFO L225 Difference]: With dead ends: 37 [2024-11-12 19:13:08,488 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 19:13:08,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 19:13:08,490 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 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-12 19:13:08,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 19:13:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 19:13:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 19:13:08,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 18 [2024-11-12 19:13:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:08,494 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 19:13:08,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 19:13:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 19:13:08,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:08,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 19:13:08,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1074634941, now seen corresponding path program 1 times [2024-11-12 19:13:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:13:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722039863] [2024-11-12 19:13:08,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:13:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:08,531 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:13:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:08,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 19:13:08,574 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:13:08,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:13:08,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:13:08,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 19:13:08,579 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 19:13:08,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:13:08,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:13:08 BoogieIcfgContainer [2024-11-12 19:13:08,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:13:08,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:13:08,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:13:08,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:13:08,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:07" (3/4) ... [2024-11-12 19:13:08,609 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:13:08,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:13:08,610 INFO L158 Benchmark]: Toolchain (without parser) took 2111.01ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 65.1MB in the beginning and 152.2MB in the end (delta: -87.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:08,611 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:08,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 866.47ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 64.8MB in the beginning and 123.3MB in the end (delta: -58.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-12 19:13:08,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.18ms. Allocated memory is still 211.8MB. Free memory was 123.3MB in the beginning and 120.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 19:13:08,612 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 211.8MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:13:08,612 INFO L158 Benchmark]: RCFGBuilder took 380.54ms. Allocated memory is still 211.8MB. Free memory was 118.0MB in the beginning and 99.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 19:13:08,613 INFO L158 Benchmark]: TraceAbstraction took 757.78ms. Allocated memory is still 211.8MB. Free memory was 98.1MB in the beginning and 152.2MB in the end (delta: -54.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:08,613 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 211.8MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:08,615 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.15ms. Allocated memory is still 138.4MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 866.47ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 64.8MB in the beginning and 123.3MB in the end (delta: -58.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.18ms. Allocated memory is still 211.8MB. Free memory was 123.3MB in the beginning and 120.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 211.8MB. Free memory was 120.1MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.54ms. Allocated memory is still 211.8MB. Free memory was 118.0MB in the beginning and 99.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 757.78ms. Allocated memory is still 211.8MB. Free memory was 98.1MB in the beginning and 152.2MB in the end (delta: -54.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 211.8MB. Free memory is still 152.2MB. 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: 1561]: 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 1569. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] 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, staticFive=5] [L1555] 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, staticFive=5] [L1555] 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, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 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, staticFive=5] [L1559] COND TRUE data > 0 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, staticFive=5] [L1561] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] - UnprovableResult [Line: 1561]: 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 2 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 104 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-12 19:13:08,636 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 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_multiply_07_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 d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:13:10,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:13:10,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 19:13:10,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:13:10,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:13:10,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 19:13:10,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:13:10,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:13:10,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:13:10,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:13:10,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:13:10,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:13:10,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:13:10,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:13:10,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:13:10,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:13:10,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:13:10,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:13:10,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:13:10,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:13:10,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:13:10,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:13:10,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 19:13:10,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 19:13:10,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:13:10,768 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:13:10,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 19:13:10,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:13:10,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:13:10,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:13:10,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:13:10,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:13:10,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:13:10,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:13:10,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:10,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:13:10,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:13:10,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:13:10,772 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 19:13:10,772 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 19:13:10,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:13:10,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:13:10,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:13:10,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:13:10,773 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 -> d2de09b099c87a914607a5ac3799b356356628e82455e6d9da6125bfe6a50c85 [2024-11-12 19:13:11,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:13:11,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:13:11,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:13:11,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:13:11,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:13:11,092 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_multiply_07_bad.i [2024-11-12 19:13:12,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:13:12,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:13:12,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-12 19:13:12,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ecb402d/c79cdc5f1cc649cd990ee6e63751f555/FLAGe2511388b [2024-11-12 19:13:12,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ecb402d/c79cdc5f1cc649cd990ee6e63751f555 [2024-11-12 19:13:12,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:13:12,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:13:12,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:12,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:13:12,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:13:12,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:12" (1/1) ... [2024-11-12 19:13:12,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d2f3403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:12, skipping insertion in model container [2024-11-12 19:13:12,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:13:12" (1/1) ... [2024-11-12 19:13:12,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:13:13,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:13,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:13:13,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:13:13,753 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:13:13,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13 WrapperNode [2024-11-12 19:13:13,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:13:13,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:13,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:13:13,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:13:13,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,809 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-12 19:13:13,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:13:13,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:13:13,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:13:13,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:13:13,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,828 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:13:13,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:13:13,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:13:13,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:13:13,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:13:13,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (1/1) ... [2024-11-12 19:13:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:13:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:13:13,877 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-12 19:13:13,882 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-12 19:13:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:13:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:13:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:13:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:13:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:13:14,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:13:14,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:13:14,167 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 19:13:14,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:13:14,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:13:14,176 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:13:14,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:14 BoogieIcfgContainer [2024-11-12 19:13:14,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:13:14,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:13:14,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:13:14,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:13:14,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:13:12" (1/3) ... [2024-11-12 19:13:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae65eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:14, skipping insertion in model container [2024-11-12 19:13:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:13:13" (2/3) ... [2024-11-12 19:13:14,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae65eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:13:14, skipping insertion in model container [2024-11-12 19:13:14,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:14" (3/3) ... [2024-11-12 19:13:14,183 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_07_bad.i [2024-11-12 19:13:14,200 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:13:14,200 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:13:14,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:13:14,246 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;@32ba35c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:13:14,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:13:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:13:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 19:13:14,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:14,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:14,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:14,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1258159597, now seen corresponding path program 1 times [2024-11-12 19:13:14,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200950401] [2024-11-12 19:13:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:14,293 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-12 19:13:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:14,299 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-12 19:13:14,301 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-12 19:13:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:14,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:13:14,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:13:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:14,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:13:14,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:13:14,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200950401] [2024-11-12 19:13:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200950401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:13:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274908599] [2024-11-12 19:13:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:13:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:14,515 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:14,545 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-12 19:13:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 19:13:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:14,555 INFO L225 Difference]: With dead ends: 41 [2024-11-12 19:13:14,556 INFO L226 Difference]: Without dead ends: 17 [2024-11-12 19:13:14,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-12 19:13:14,564 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:13:14,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-12 19:13:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-12 19:13:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-12 19:13:14,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-11-12 19:13:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:14,602 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-12 19:13:14,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-12 19:13:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 19:13:14,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:14,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:14,611 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-12 19:13:14,809 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-12 19:13:14,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1822236216, now seen corresponding path program 1 times [2024-11-12 19:13:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101601236] [2024-11-12 19:13:14,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:14,812 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-12 19:13:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:14,821 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-12 19:13:14,837 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-12 19:13:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:13:14,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:13:14,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:13:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:13:14,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:13:14,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:13:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101601236] [2024-11-12 19:13:14,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101601236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:13:14,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:13:14,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:13:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194553702] [2024-11-12 19:13:14,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:13:14,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:13:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:13:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:13:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:13:14,910 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:13:14,920 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-12 19:13:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:13:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 19:13:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:13:14,921 INFO L225 Difference]: With dead ends: 17 [2024-11-12 19:13:14,922 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 19:13:14,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-12 19:13:14,923 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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-12 19:13:14,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:13:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 19:13:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-12 19:13:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-12 19:13:14,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-12 19:13:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:13:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-12 19:13:14,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:13:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-12 19:13:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 19:13:14,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:13:14,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:13:14,936 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-12 19:13:15,133 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-12 19:13:15,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:13:15,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:13:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 654747913, now seen corresponding path program 1 times [2024-11-12 19:13:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:13:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564975663] [2024-11-12 19:13:15,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:13:15,136 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-12 19:13:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:13:15,143 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-12 19:13:15,145 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-12 19:13:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:15,236 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:13:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:13:15,299 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 19:13:15,299 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:13:15,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:13:15,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:13:15,307 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-12 19:13:15,502 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-12 19:13:15,505 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 19:13:15,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:13:15,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:13:15 BoogieIcfgContainer [2024-11-12 19:13:15,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:13:15,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:13:15,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:13:15,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:13:15,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:13:14" (3/4) ... [2024-11-12 19:13:15,553 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:13:15,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:13:15,554 INFO L158 Benchmark]: Toolchain (without parser) took 2725.89ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 46.0MB in the beginning and 146.4MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:15,558 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 88.1MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:15,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 924.65ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 45.7MB in the beginning and 113.0MB in the end (delta: -67.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-12 19:13:15,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.76ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 109.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 19:13:15,559 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:13:15,560 INFO L158 Benchmark]: RCFGBuilder took 337.26ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 92.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 19:13:15,560 INFO L158 Benchmark]: TraceAbstraction took 1367.17ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 146.5MB in the end (delta: -54.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 19:13:15,560 INFO L158 Benchmark]: Witness Printer took 7.86ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 146.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:13:15,590 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.11ms. Allocated memory is still 88.1MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 924.65ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 45.7MB in the beginning and 113.0MB in the end (delta: -67.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.76ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 109.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.26ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 92.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1367.17ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 146.5MB in the end (delta: -54.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 7.86ms. Allocated memory is still 176.2MB. Free memory was 146.5MB in the beginning and 146.4MB in the end (delta: 160.8kB). 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: 1561]: 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 1569. 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); [L1548] static int staticFive = 5; VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1569] 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, staticFive=5] [L1414] COND TRUE line != ((void *)0) [L1569] 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, staticFive=5] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_07_bad() [L1551] int data; [L1552] 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, staticFive=5] [L1553] COND TRUE staticFive==5 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] 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, staticFive=5] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE staticFive==5 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1559] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] [L1561] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, staticFive=5] - UnprovableResult [Line: 1561]: 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 2 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-12 19:13:15,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample