./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_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 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:28:11,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:28:11,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 22:28:11,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:28:11,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:28:11,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:28:11,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:28:11,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:28:11,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:28:11,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:28:11,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:28:11,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:28:11,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:28:11,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:28:11,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:28:11,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:28:11,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:28:11,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 22:28:11,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:28:11,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:28:11,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:28:11,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:28:11,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:28:11,582 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:28:11,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:28:11,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:28:11,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:28:11,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:28:11,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:28:11,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:28:11,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:28:11,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:28:11,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:28:11,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:28:11,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:28:11,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 22:28:11,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 22:28:11,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:28:11,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:28:11,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:28:11,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:28:11,588 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 -> 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 [2024-10-14 22:28:11,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:28:11,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:28:11,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:28:11,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:28:11,869 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:28:11,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:13,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:28:13,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:28:13,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:13,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cc46db9/3f90b7b70c1a47f8b058f70862df552d/FLAGf5ebdef01 [2024-10-14 22:28:13,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cc46db9/3f90b7b70c1a47f8b058f70862df552d [2024-10-14 22:28:13,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:28:13,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:28:13,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:28:13,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:28:13,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:28:13,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:28:13" (1/1) ... [2024-10-14 22:28:13,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5183581f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:13, skipping insertion in model container [2024-10-14 22:28:13,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:28:13" (1/1) ... [2024-10-14 22:28:13,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:28:14,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:28:14,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:28:14,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:28:14,772 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:28:14,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14 WrapperNode [2024-10-14 22:28:14,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:28:14,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:28:14,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:28:14,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:28:14,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,855 INFO L138 Inliner]: procedures = 497, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-10-14 22:28:14,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:28:14,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:28:14,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:28:14,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:28:14,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,892 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:28:14,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:28:14,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:28:14,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:28:14,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:28:14,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (1/1) ... [2024-10-14 22:28:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:28:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:28:14,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 22:28:14,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 22:28:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:28:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:28:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-14 22:28:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-14 22:28:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:28:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:28:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:28:15,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:28:15,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:28:15,382 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-14 22:28:15,382 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:28:15,416 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:28:15,417 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:28:15,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:15 BoogieIcfgContainer [2024-10-14 22:28:15,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:28:15,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:28:15,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:28:15,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:28:15,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:28:13" (1/3) ... [2024-10-14 22:28:15,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4cf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:28:15, skipping insertion in model container [2024-10-14 22:28:15,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:14" (2/3) ... [2024-10-14 22:28:15,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4cf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:28:15, skipping insertion in model container [2024-10-14 22:28:15,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:15" (3/3) ... [2024-10-14 22:28:15,429 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:15,451 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:28:15,451 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:28:15,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:28:15,528 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;@3597203f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:28:15,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:28:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 36 states have (on average 1.5) internal successors, (54), 38 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:28:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 22:28:15,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:15,539 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:15,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1106863049, now seen corresponding path program 1 times [2024-10-14 22:28:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:28:15,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935293433] [2024-10-14 22:28:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:28:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:28:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:28:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 22:28:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 22:28:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:28:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935293433] [2024-10-14 22:28:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935293433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 22:28:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341605821] [2024-10-14 22:28:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 22:28:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:28:15,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 22:28:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 22:28:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 22:28:16,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:28:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:28:16,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:28:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341605821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:16,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 22:28:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 22:28:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838633025] [2024-10-14 22:28:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:16,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:28:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:28:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:28:16,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 22:28:16,200 INFO L87 Difference]: Start difference. First operand has 45 states, 36 states have (on average 1.5) internal successors, (54), 38 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:16,243 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-10-14 22:28:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:28:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-10-14 22:28:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:16,253 INFO L225 Difference]: With dead ends: 52 [2024-10-14 22:28:16,253 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 22:28:16,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 22:28:16,261 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:16,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:28:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 22:28:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-14 22:28:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:28:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-10-14 22:28:16,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 18 [2024-10-14 22:28:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-10-14 22:28:16,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-10-14 22:28:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:28:16,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:16,302 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:16,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 22:28:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-14 22:28:16,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 46983987, now seen corresponding path program 1 times [2024-10-14 22:28:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:28:16,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450559151] [2024-10-14 22:28:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:28:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:28:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:28:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 22:28:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 22:28:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:28:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450559151] [2024-10-14 22:28:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450559151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 22:28:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852815620] [2024-10-14 22:28:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 22:28:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:28:16,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 22:28:16,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 22:28:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:16,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 22:28:16,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:28:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:28:16,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:28:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852815620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 22:28:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 22:28:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197169527] [2024-10-14 22:28:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:28:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:28:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:28:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 22:28:16,754 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:16,779 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-10-14 22:28:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:28:16,780 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-14 22:28:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:16,781 INFO L225 Difference]: With dead ends: 47 [2024-10-14 22:28:16,781 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 22:28:16,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 22:28:16,782 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:16,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:28:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 22:28:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 22:28:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 22:28:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-14 22:28:16,790 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 19 [2024-10-14 22:28:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:16,791 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-14 22:28:16,791 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-14 22:28:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 22:28:16,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:16,792 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:16,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 22:28:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-14 22:28:16,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -274291436, now seen corresponding path program 1 times [2024-10-14 22:28:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:28:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531445814] [2024-10-14 22:28:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:28:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:28:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:28:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:28:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:28:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:28:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531445814] [2024-10-14 22:28:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531445814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:28:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 22:28:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720208994] [2024-10-14 22:28:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 22:28:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:28:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 22:28:17,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 22:28:17,224 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:17,315 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-10-14 22:28:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 22:28:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 22:28:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:17,317 INFO L225 Difference]: With dead ends: 49 [2024-10-14 22:28:17,317 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 22:28:17,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 22:28:17,318 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 41 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:17,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 22:28:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 22:28:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-14 22:28:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:28:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-10-14 22:28:17,329 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 24 [2024-10-14 22:28:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:17,329 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-10-14 22:28:17,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-10-14 22:28:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 22:28:17,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:17,330 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 22:28:17,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:17,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash -562845778, now seen corresponding path program 1 times [2024-10-14 22:28:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:28:17,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020456044] [2024-10-14 22:28:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:28:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 22:28:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 22:28:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 22:28:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:28:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 22:28:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020456044] [2024-10-14 22:28:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020456044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:17,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:28:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 22:28:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625395262] [2024-10-14 22:28:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 22:28:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 22:28:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 22:28:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:28:17,432 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:17,447 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-10-14 22:28:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 22:28:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 22:28:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:17,448 INFO L225 Difference]: With dead ends: 47 [2024-10-14 22:28:17,448 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 22:28:17,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 22:28:17,450 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:17,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:28:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 22:28:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-10-14 22:28:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 22:28:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-10-14 22:28:17,455 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 24 [2024-10-14 22:28:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:17,455 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-10-14 22:28:17,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-10-14 22:28:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 22:28:17,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:17,456 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 22:28:17,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 86900214, now seen corresponding path program 1 times [2024-10-14 22:28:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 22:28:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228695456] [2024-10-14 22:28:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 22:28:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:28:17,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:28:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:28:17,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 22:28:17,518 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:28:17,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:28:17,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:28:17,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 22:28:17,526 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 22:28:17,558 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:28:17,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:28:17 BoogieIcfgContainer [2024-10-14 22:28:17,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:28:17,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:28:17,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:28:17,576 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:28:17,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:15" (3/4) ... [2024-10-14 22:28:17,579 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:28:17,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:28:17,581 INFO L158 Benchmark]: Toolchain (without parser) took 3875.48ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 93.6MB in the beginning and 164.9MB in the end (delta: -71.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:28:17,581 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:28:17,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1065.38ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 93.2MB in the beginning and 132.2MB in the end (delta: -39.0MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-10-14 22:28:17,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.27ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 129.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:28:17,582 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:28:17,582 INFO L158 Benchmark]: RCFGBuilder took 510.96ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 108.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 22:28:17,583 INFO L158 Benchmark]: TraceAbstraction took 2143.96ms. Allocated memory is still 201.3MB. Free memory was 108.0MB in the beginning and 63.1MB in the end (delta: 44.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-14 22:28:17,583 INFO L158 Benchmark]: Witness Printer took 7.04ms. Allocated memory is still 201.3MB. Free memory was 164.9MB in the beginning and 164.9MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:28:17,587 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1065.38ms. Allocated memory was 153.1MB in the beginning and 201.3MB in the end (delta: 48.2MB). Free memory was 93.2MB in the beginning and 132.2MB in the end (delta: -39.0MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.27ms. Allocated memory is still 201.3MB. Free memory was 132.2MB in the beginning and 129.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.96ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 108.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2143.96ms. Allocated memory is still 201.3MB. Free memory was 108.0MB in the beginning and 63.1MB in the end (delta: 44.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 7.04ms. Allocated memory is still 201.3MB. Free memory was 164.9MB in the beginning and 164.9MB in the end (delta: 2.6kB). 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: 1559]: 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 1567. 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); [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] 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] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_11_bad() [L1550] int data; [L1551] 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] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1552] RET globalReturnsTrue() 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] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] 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] [L1554] 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] [L1554] 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] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1556] RET globalReturnsTrue() 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] [L1556] COND TRUE globalReturnsTrue() [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 211 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 10/12 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-10-14 22:28:17,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_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 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 22:28:19,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 22:28:19,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-14 22:28:19,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 22:28:19,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 22:28:19,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-14 22:28:19,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 22:28:19,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 22:28:19,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 22:28:19,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 22:28:19,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 22:28:19,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 22:28:19,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 22:28:19,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 22:28:19,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 22:28:19,987 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 22:28:19,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 22:28:19,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 22:28:19,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 22:28:19,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 22:28:19,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 22:28:19,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 22:28:19,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 22:28:19,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 22:28:19,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 22:28:19,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 22:28:19,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 22:28:19,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 22:28:19,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 22:28:19,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:28:19,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 22:28:19,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 22:28:19,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 22:28:19,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 22:28:19,995 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 22:28:19,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 22:28:19,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 22:28:19,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 22:28:19,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 22:28:19,999 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 22:28:19,999 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 -> 975907b0015572066daa603a1ac95088b358b0e53326aabe86e19a7fbf8c42c4 [2024-10-14 22:28:20,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 22:28:20,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 22:28:20,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 22:28:20,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 22:28:20,315 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 22:28:20,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:21,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 22:28:22,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 22:28:22,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:22,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9237c530a/2de61d7eebb14bedbc681f955c3131c9/FLAGe1e8ba67a [2024-10-14 22:28:22,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9237c530a/2de61d7eebb14bedbc681f955c3131c9 [2024-10-14 22:28:22,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 22:28:22,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 22:28:22,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 22:28:22,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 22:28:22,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 22:28:22,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:28:22" (1/1) ... [2024-10-14 22:28:22,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5161a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:22, skipping insertion in model container [2024-10-14 22:28:22,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:28:22" (1/1) ... [2024-10-14 22:28:22,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 22:28:23,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:28:23,139 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 22:28:23,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 22:28:23,332 INFO L204 MainTranslator]: Completed translation [2024-10-14 22:28:23,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23 WrapperNode [2024-10-14 22:28:23,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 22:28:23,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 22:28:23,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 22:28:23,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 22:28:23,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,403 INFO L138 Inliner]: procedures = 502, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2024-10-14 22:28:23,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 22:28:23,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 22:28:23,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 22:28:23,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 22:28:23,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,444 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 22:28:23,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 22:28:23,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 22:28:23,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 22:28:23,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 22:28:23,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (1/1) ... [2024-10-14 22:28:23,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 22:28:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 22:28:23,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 22:28:23,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 22:28:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 22:28:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 22:28:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2024-10-14 22:28:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2024-10-14 22:28:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 22:28:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 22:28:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 22:28:23,750 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 22:28:23,752 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 22:28:23,914 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 22:28:23,914 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 22:28:23,962 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 22:28:23,963 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 22:28:23,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:23 BoogieIcfgContainer [2024-10-14 22:28:23,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 22:28:23,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 22:28:23,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 22:28:23,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 22:28:23,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:28:22" (1/3) ... [2024-10-14 22:28:23,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dfb432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:28:23, skipping insertion in model container [2024-10-14 22:28:23,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:28:23" (2/3) ... [2024-10-14 22:28:23,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dfb432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:28:23, skipping insertion in model container [2024-10-14 22:28:23,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:23" (3/3) ... [2024-10-14 22:28:23,975 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_11_bad.i [2024-10-14 22:28:23,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 22:28:23,993 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 22:28:24,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 22:28:24,086 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;@5e1316e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 22:28:24,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 22:28:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 22:28:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 22:28:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:24,101 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:24,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:24,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1569213815, now seen corresponding path program 1 times [2024-10-14 22:28:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:28:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565853104] [2024-10-14 22:28:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:24,122 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-10-14 22:28:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:28:24,125 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-10-14 22:28:24,126 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-10-14 22:28:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:24,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 22:28:24,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:28:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 22:28:24,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:28:24,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:28:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565853104] [2024-10-14 22:28:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565853104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:28:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 22:28:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056397485] [2024-10-14 22:28:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 22:28:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:28:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 22:28:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:28:24,309 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 22:28:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:24,333 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-14 22:28:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 22:28:24,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2024-10-14 22:28:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:24,342 INFO L225 Difference]: With dead ends: 23 [2024-10-14 22:28:24,342 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 22:28:24,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 22:28:24,350 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:24,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:28:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 22:28:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 22:28:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 22:28:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-14 22:28:24,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2024-10-14 22:28:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:24,390 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-14 22:28:24,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 22:28:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-14 22:28:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 22:28:24,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:24,393 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:24,399 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-10-14 22:28:24,597 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-10-14 22:28:24,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:24,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:24,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1400988073, now seen corresponding path program 1 times [2024-10-14 22:28:24,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:28:24,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679759376] [2024-10-14 22:28:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:24,600 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-10-14 22:28:24,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:28:24,603 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-10-14 22:28:24,605 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-10-14 22:28:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 22:28:24,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 22:28:24,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 22:28:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 22:28:24,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 22:28:24,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 22:28:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679759376] [2024-10-14 22:28:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679759376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 22:28:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 22:28:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 22:28:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250981492] [2024-10-14 22:28:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 22:28:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 22:28:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 22:28:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 22:28:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:28:24,736 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 22:28:24,753 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-14 22:28:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 22:28:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-10-14 22:28:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 22:28:24,755 INFO L225 Difference]: With dead ends: 25 [2024-10-14 22:28:24,755 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 22:28:24,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 22:28:24,757 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 22:28:24,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 22:28:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 22:28:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 22:28:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 22:28:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-14 22:28:24,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2024-10-14 22:28:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 22:28:24,762 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-14 22:28:24,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 22:28:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-14 22:28:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 22:28:24,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 22:28:24,762 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 22:28:24,769 INFO L552 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)] Ended with exit code 0 [2024-10-14 22:28:24,967 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-10-14 22:28:24,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-14 22:28:24,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 22:28:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 955631684, now seen corresponding path program 1 times [2024-10-14 22:28:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 22:28:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608544671] [2024-10-14 22:28:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 22:28:24,970 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-10-14 22:28:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 22:28:24,973 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-10-14 22:28:24,974 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-10-14 22:28:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:28:25,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 22:28:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 22:28:25,122 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 22:28:25,123 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 22:28:25,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-14 22:28:25,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-14 22:28:25,131 INFO L552 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)] Ended with exit code 0 [2024-10-14 22:28:25,326 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-10-14 22:28:25,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 22:28:25,357 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 22:28:25,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:28:25 BoogieIcfgContainer [2024-10-14 22:28:25,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 22:28:25,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 22:28:25,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 22:28:25,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 22:28:25,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:28:23" (3/4) ... [2024-10-14 22:28:25,365 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 22:28:25,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 22:28:25,367 INFO L158 Benchmark]: Toolchain (without parser) took 3063.29ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 47.6MB in the beginning and 41.3MB in the end (delta: 6.3MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,367 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 50.3MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:28:25,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1029.21ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 47.3MB in the beginning and 75.6MB in the end (delta: -28.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.20ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 72.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,369 INFO L158 Benchmark]: Boogie Preprocessor took 73.33ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,369 INFO L158 Benchmark]: RCFGBuilder took 484.34ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 53.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,369 INFO L158 Benchmark]: TraceAbstraction took 1394.84ms. Allocated memory is still 107.0MB. Free memory was 53.1MB in the beginning and 41.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 22:28:25,369 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 107.0MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 22:28:25,375 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.09ms. Allocated memory is still 50.3MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1029.21ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 47.3MB in the beginning and 75.6MB in the end (delta: -28.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.20ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 72.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.33ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.34ms. Allocated memory is still 107.0MB. Free memory was 69.8MB in the beginning and 53.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1394.84ms. Allocated memory is still 107.0MB. Free memory was 53.1MB in the beginning and 41.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 107.0MB. Free memory is still 41.3MB. 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: 1559]: 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 1567. 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); [L1567] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1567] 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] [L1568] CALL CWE190_Integer_Overflow__int_rand_add_11_bad() [L1550] int data; [L1551] 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] [L1552] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1552] RET globalReturnsTrue() 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] [L1552] COND TRUE globalReturnsTrue() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] 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] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] CALL globalReturnsTrue() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1512] return 1; [L1556] RET globalReturnsTrue() 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] [L1556] COND TRUE globalReturnsTrue() [L1559] data + 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1559]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 0 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4/4 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-10-14 22:28:25,403 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