./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:00:33,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:00:33,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 12:00:33,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:00:33,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:00:33,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:00:33,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:00:33,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:00:33,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:00:33,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:00:33,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:00:33,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:00:33,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:00:33,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:00:33,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:00:33,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:00:33,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:00:33,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 12:00:33,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:00:33,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:00:33,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:00:33,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:00:33,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:00:33,498 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:00:33,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:00:33,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:00:33,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:00:33,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:00:33,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:00:33,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:00:33,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:00:33,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:00:33,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:00:33,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:00:33,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:00:33,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 12:00:33,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 12:00:33,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:00:33,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:00:33,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:00:33,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:00:33,508 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-11-19 12:00:33,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:00:33,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:00:33,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:00:33,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:00:33,777 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:00:33,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:35,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:00:35,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:00:35,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:35,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527d93354/a2bc5cc9a1514ab7ac4b157ad9f4fafc/FLAG7c2052963 [2024-11-19 12:00:35,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527d93354/a2bc5cc9a1514ab7ac4b157ad9f4fafc [2024-11-19 12:00:35,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:00:35,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:00:35,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:00:35,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:00:35,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:00:35,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:35" (1/1) ... [2024-11-19 12:00:35,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6559e018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:35, skipping insertion in model container [2024-11-19 12:00:35,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:35" (1/1) ... [2024-11-19 12:00:35,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:00:36,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:00:36,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:00:36,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:00:37,043 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:00:37,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37 WrapperNode [2024-11-19 12:00:37,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:00:37,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:00:37,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:00:37,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:00:37,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,106 INFO L138 Inliner]: procedures = 498, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-11-19 12:00:37,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:00:37,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:00:37,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:00:37,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:00:37,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,151 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-19 12:00:37,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:00:37,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:00:37,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:00:37,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:00:37,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (1/1) ... [2024-11-19 12:00:37,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:00:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:00:37,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 12:00:37,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 12:00:37,246 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:00:37,247 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:00:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:00:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:00:37,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:00:37,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 12:00:37,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:00:37,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:00:37,559 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-19 12:00:37,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:00:37,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:00:37,573 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 12:00:37,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:37 BoogieIcfgContainer [2024-11-19 12:00:37,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:00:37,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:00:37,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:00:37,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:00:37,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:00:35" (1/3) ... [2024-11-19 12:00:37,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bf7e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:37, skipping insertion in model container [2024-11-19 12:00:37,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:37" (2/3) ... [2024-11-19 12:00:37,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bf7e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:37, skipping insertion in model container [2024-11-19 12:00:37,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:37" (3/3) ... [2024-11-19 12:00:37,585 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:37,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:00:37,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 12:00:37,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:00:37,679 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;@4ca81c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:00:37,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 12:00:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:00:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:00:37,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:37,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:37,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -153162690, now seen corresponding path program 1 times [2024-11-19 12:00:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:00:37,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596883682] [2024-11-19 12:00:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:00:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:00:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596883682] [2024-11-19 12:00:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596883682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:00:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116838100] [2024-11-19 12:00:37,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:00:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:00:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:00:37,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:00:38,000 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:38,034 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-19 12:00:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:00:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 12:00:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:38,043 INFO L225 Difference]: With dead ends: 64 [2024-11-19 12:00:38,043 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 12:00:38,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:00:38,049 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:00:38,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 12:00:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-19 12:00:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 12:00:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-19 12:00:38,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2024-11-19 12:00:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:38,087 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 12:00:38,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-19 12:00:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 12:00:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:38,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 12:00:38,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -451723501, now seen corresponding path program 1 times [2024-11-19 12:00:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:00:38,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136884279] [2024-11-19 12:00:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:00:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:00:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136884279] [2024-11-19 12:00:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136884279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:38,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:38,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:00:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754261737] [2024-11-19 12:00:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:00:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:00:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:00:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:38,333 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:38,370 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-19 12:00:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:00:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 12:00:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:38,372 INFO L225 Difference]: With dead ends: 40 [2024-11-19 12:00:38,372 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 12:00:38,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:38,376 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:00:38,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 12:00:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 12:00:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:00:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-19 12:00:38,387 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2024-11-19 12:00:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:38,388 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-19 12:00:38,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-19 12:00:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 12:00:38,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:38,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 12:00:38,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash -197981435, now seen corresponding path program 1 times [2024-11-19 12:00:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:00:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96646514] [2024-11-19 12:00:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:00:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 12:00:38,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96646514] [2024-11-19 12:00:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96646514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:38,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:38,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:00:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909025631] [2024-11-19 12:00:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:00:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 12:00:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:00:38,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:38,547 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:38,573 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-19 12:00:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:00:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 12:00:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:38,577 INFO L225 Difference]: With dead ends: 38 [2024-11-19 12:00:38,577 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 12:00:38,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:38,578 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:00:38,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 12:00:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 12:00:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:00:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-19 12:00:38,591 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2024-11-19 12:00:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:38,591 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-19 12:00:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-19 12:00:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 12:00:38,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:38,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 12:00:38,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1842457108, now seen corresponding path program 1 times [2024-11-19 12:00:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 12:00:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21861098] [2024-11-19 12:00:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 12:00:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:00:38,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:00:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:00:38,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 12:00:38,675 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:00:38,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 12:00:38,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 12:00:38,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 12:00:38,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 12:00:38,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 12:00:38,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 12:00:38,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 12:00:38,685 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 12:00:38,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:00:38,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:00:38 BoogieIcfgContainer [2024-11-19 12:00:38,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:00:38,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:00:38,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:00:38,722 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:00:38,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:37" (3/4) ... [2024-11-19 12:00:38,725 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:00:38,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:00:38,728 INFO L158 Benchmark]: Toolchain (without parser) took 2900.12ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 90.9MB in the beginning and 117.1MB in the end (delta: -26.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,728 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:00:38,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1214.69ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 97.9MB in the end (delta: -6.9MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.00ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,731 INFO L158 Benchmark]: Boogie Preprocessor took 57.95ms. Allocated memory is still 146.8MB. Free memory was 95.1MB in the beginning and 92.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,731 INFO L158 Benchmark]: RCFGBuilder took 407.15ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 78.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,732 INFO L158 Benchmark]: TraceAbstraction took 1144.39ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 77.7MB in the beginning and 118.2MB in the end (delta: -40.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-19 12:00:38,732 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 117.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:00:38,733 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.22ms. Allocated memory is still 146.8MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1214.69ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 97.9MB in the end (delta: -6.9MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.00ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 95.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.95ms. Allocated memory is still 146.8MB. Free memory was 95.1MB in the beginning and 92.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.15ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 78.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1144.39ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 77.7MB in the beginning and 118.2MB in the end (delta: -40.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 190.8MB. Free memory was 118.2MB in the beginning and 117.1MB in the end (delta: 1.0MB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] 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] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 98 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:00:38,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_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 a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 12:00:40,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 12:00:41,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-19 12:00:41,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 12:00:41,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 12:00:41,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-19 12:00:41,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 12:00:41,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 12:00:41,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 12:00:41,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 12:00:41,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 12:00:41,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 12:00:41,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 12:00:41,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 12:00:41,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 12:00:41,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 12:00:41,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 12:00:41,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 12:00:41,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 12:00:41,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 12:00:41,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 12:00:41,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 12:00:41,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 12:00:41,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 12:00:41,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 12:00:41,107 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 12:00:41,108 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 12:00:41,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 12:00:41,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 12:00:41,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 12:00:41,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 12:00:41,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 12:00:41,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 12:00:41,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 12:00:41,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:00:41,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 12:00:41,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 12:00:41,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 12:00:41,111 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 12:00:41,111 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 12:00:41,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 12:00:41,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 12:00:41,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 12:00:41,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 12:00:41,114 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 -> a7bf12efb165ae38e6a5b7ea360f1f04cc4b40bbbbde4906a6f5fa41669f98f5 [2024-11-19 12:00:41,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 12:00:41,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 12:00:41,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 12:00:41,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 12:00:41,471 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 12:00:41,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:42,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 12:00:43,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 12:00:43,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:43,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9f23bb4/0c32e2a0a3b7417bb904546c1ac337c1/FLAG546ee7db8 [2024-11-19 12:00:43,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9f23bb4/0c32e2a0a3b7417bb904546c1ac337c1 [2024-11-19 12:00:43,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 12:00:43,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 12:00:43,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 12:00:43,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 12:00:43,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 12:00:43,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:43" (1/1) ... [2024-11-19 12:00:43,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461ac598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:43, skipping insertion in model container [2024-11-19 12:00:43,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:00:43" (1/1) ... [2024-11-19 12:00:43,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 12:00:44,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:00:44,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 12:00:44,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 12:00:44,563 INFO L204 MainTranslator]: Completed translation [2024-11-19 12:00:44,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44 WrapperNode [2024-11-19 12:00:44,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 12:00:44,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 12:00:44,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 12:00:44,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 12:00:44,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,637 INFO L138 Inliner]: procedures = 503, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2024-11-19 12:00:44,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 12:00:44,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 12:00:44,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 12:00:44,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 12:00:44,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,674 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-19 12:00:44,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 12:00:44,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 12:00:44,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 12:00:44,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 12:00:44,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (1/1) ... [2024-11-19 12:00:44,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 12:00:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 12:00:44,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 12:00:44,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 12:00:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-19 12:00:44,780 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-19 12:00:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 12:00:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 12:00:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 12:00:44,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 12:00:44,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 12:00:44,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 12:00:45,124 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 12:00:45,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 12:00:45,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 12:00:45,139 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 12:00:45,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:45 BoogieIcfgContainer [2024-11-19 12:00:45,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 12:00:45,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 12:00:45,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 12:00:45,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 12:00:45,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:00:43" (1/3) ... [2024-11-19 12:00:45,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134ba822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:45, skipping insertion in model container [2024-11-19 12:00:45,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:00:44" (2/3) ... [2024-11-19 12:00:45,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134ba822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:00:45, skipping insertion in model container [2024-11-19 12:00:45,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:45" (3/3) ... [2024-11-19 12:00:45,151 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_17_bad.i [2024-11-19 12:00:45,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 12:00:45,168 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 12:00:45,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 12:00:45,251 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;@2a86416a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 12:00:45,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 12:00:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:00:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 12:00:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:45,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:45,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -153162690, now seen corresponding path program 1 times [2024-11-19 12:00:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:00:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128110776] [2024-11-19 12:00:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:45,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:00:45,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:00:45,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 12:00:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:45,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 12:00:45,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:00:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:45,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:00:45,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:00:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128110776] [2024-11-19 12:00:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128110776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:45,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 12:00:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091983387] [2024-11-19 12:00:45,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 12:00:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:00:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 12:00:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:00:45,498 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:45,516 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-19 12:00:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 12:00:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 12:00:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:45,526 INFO L225 Difference]: With dead ends: 56 [2024-11-19 12:00:45,526 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 12:00:45,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 12:00:45,533 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:00:45,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 12:00:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 12:00:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 12:00:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-19 12:00:45,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2024-11-19 12:00:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:45,565 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-19 12:00:45,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 10.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-19 12:00:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 12:00:45,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:45,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:45,574 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 (2)] Ended with exit code 0 [2024-11-19 12:00:45,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:45,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -453076013, now seen corresponding path program 1 times [2024-11-19 12:00:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:00:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136484041] [2024-11-19 12:00:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:45,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:45,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:00:45,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:00:45,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 12:00:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:45,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 12:00:45,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:00:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:45,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:00:45,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:00:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136484041] [2024-11-19 12:00:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136484041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:00:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480087087] [2024-11-19 12:00:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:45,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 12:00:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:00:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 12:00:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:00:45,877 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:45,898 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-19 12:00:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 12:00:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 12:00:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:45,900 INFO L225 Difference]: With dead ends: 43 [2024-11-19 12:00:45,900 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 12:00:45,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 12:00:45,902 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 12:00:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 12:00:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-19 12:00:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 12:00:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 12:00:45,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2024-11-19 12:00:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 12:00:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-19 12:00:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 12:00:45,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:45,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:45,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 12:00:46,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:46,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:46,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1118526578, now seen corresponding path program 1 times [2024-11-19 12:00:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:00:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289355759] [2024-11-19 12:00:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:00:46,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:00:46,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 12:00:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 12:00:46,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 12:00:46,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 12:00:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 12:00:46,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 12:00:46,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 12:00:46,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289355759] [2024-11-19 12:00:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289355759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 12:00:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 12:00:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 12:00:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574290027] [2024-11-19 12:00:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 12:00:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 12:00:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 12:00:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 12:00:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:46,280 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 12:00:46,314 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-19 12:00:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 12:00:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 12:00:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 12:00:46,316 INFO L225 Difference]: With dead ends: 36 [2024-11-19 12:00:46,317 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 12:00:46,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 12:00:46,318 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 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-11-19 12:00:46,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 12:00:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 12:00:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 12:00:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 12:00:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-19 12:00:46,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 14 [2024-11-19 12:00:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 12:00:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-19 12:00:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 12:00:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-19 12:00:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 12:00:46,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 12:00:46,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 12:00:46,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 12:00:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:46,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 12:00:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 12:00:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1842457108, now seen corresponding path program 1 times [2024-11-19 12:00:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 12:00:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42813259] [2024-11-19 12:00:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 12:00:46,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 12:00:46,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 12:00:46,539 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 (5)] Waiting until timeout for monitored process [2024-11-19 12:00:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:00:46,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 12:00:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 12:00:46,712 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 12:00:46,712 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 12:00:46,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-19 12:00:46,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-19 12:00:46,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-19 12:00:46,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-19 12:00:46,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-19 12:00:46,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-19 12:00:46,725 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 (5)] Ended with exit code 0 [2024-11-19 12:00:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 12:00:46,926 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 12:00:46,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 12:00:47,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:00:47 BoogieIcfgContainer [2024-11-19 12:00:47,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 12:00:47,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 12:00:47,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 12:00:47,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 12:00:47,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:00:45" (3/4) ... [2024-11-19 12:00:47,012 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 12:00:47,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 12:00:47,013 INFO L158 Benchmark]: Toolchain (without parser) took 3660.88ms. Allocated memory was 60.8MB in the beginning and 96.5MB in the end (delta: 35.7MB). Free memory was 38.6MB in the beginning and 64.3MB in the end (delta: -25.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,014 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 50.3MB. Free memory is still 23.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:00:47,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1214.14ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 38.4MB in the beginning and 45.5MB in the end (delta: -7.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.77ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 42.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,015 INFO L158 Benchmark]: Boogie Preprocessor took 61.99ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 39.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,015 INFO L158 Benchmark]: RCFGBuilder took 438.00ms. Allocated memory is still 73.4MB. Free memory was 39.5MB in the beginning and 41.0MB in the end (delta: -1.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,018 INFO L158 Benchmark]: TraceAbstraction took 1863.86ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.3MB in the beginning and 64.6MB in the end (delta: -24.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-19 12:00:47,018 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 64.3MB in the end (delta: 260.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 12:00:47,019 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.14ms. Allocated memory is still 50.3MB. Free memory is still 23.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1214.14ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 38.4MB in the beginning and 45.5MB in the end (delta: -7.1MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.77ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 42.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.99ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 39.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.00ms. Allocated memory is still 73.4MB. Free memory was 39.5MB in the beginning and 41.0MB in the end (delta: -1.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1863.86ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.3MB in the beginning and 64.6MB in the end (delta: -24.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 64.3MB in the end (delta: 260.9kB). 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: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1579, overapproximation of fgets at line 1557. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1579] 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] [L1580] CALL CWE190_Integer_Overflow__int_fgets_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 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, i=0] [L1553] COND TRUE i < 1 [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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, i=0] [L1557] COND TRUE fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0) [L1559] data = atoi(inputBuffer) [L1553] i++ 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, i=1] [L1553] COND FALSE !(i < 1) 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] [L1567] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1567] COND TRUE j < 1 [L1570] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1567]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 94 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 0 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 12:00:47,049 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