./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_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 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:45:02,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:45:02,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 21:45:02,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:45:02,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:45:02,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:45:02,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:45:02,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:45:02,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:45:02,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:45:02,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:45:02,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:45:02,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:45:02,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:45:02,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:45:02,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:45:02,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:45:02,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 21:45:02,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:45:02,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:45:02,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:45:02,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:45:02,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:45:02,413 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:45:02,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:45:02,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:45:02,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:45:02,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:45:02,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:45:02,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:45:02,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:45:02,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:45:02,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:45:02,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:45:02,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:45:02,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 21:45:02,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 21:45:02,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:45:02,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:45:02,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:45:02,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:45:02,419 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 -> 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf [2024-10-24 21:45:02,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:45:02,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:45:02,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:45:02,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:45:02,727 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:45:02,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:04,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:45:04,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:45:04,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:04,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb9671cb/bf681f43581945e2820c0f09cb8b9be6/FLAG6879f0486 [2024-10-24 21:45:04,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb9671cb/bf681f43581945e2820c0f09cb8b9be6 [2024-10-24 21:45:04,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:45:04,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:45:04,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:45:04,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:45:04,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:45:04,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:04" (1/1) ... [2024-10-24 21:45:04,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e6ed4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:04, skipping insertion in model container [2024-10-24 21:45:04,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:04" (1/1) ... [2024-10-24 21:45:04,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:45:05,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:45:05,658 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:45:05,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:45:05,948 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:45:05,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05 WrapperNode [2024-10-24 21:45:05,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:45:05,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:45:05,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:45:05,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:45:05,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:05,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,017 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-10-24 21:45:06,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:45:06,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:45:06,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:45:06,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:45:06,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,045 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 21:45:06,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:45:06,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:45:06,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:45:06,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:45:06,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (1/1) ... [2024-10-24 21:45:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:45:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:45:06,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 21:45:06,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 21:45:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:45:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:45:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:45:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:45:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:45:06,314 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:45:06,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:45:06,432 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 21:45:06,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:45:06,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:45:06,461 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 21:45:06,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:06 BoogieIcfgContainer [2024-10-24 21:45:06,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:45:06,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:45:06,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:45:06,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:45:06,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:45:04" (1/3) ... [2024-10-24 21:45:06,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e81caf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:06, skipping insertion in model container [2024-10-24 21:45:06,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:05" (2/3) ... [2024-10-24 21:45:06,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e81caf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:06, skipping insertion in model container [2024-10-24 21:45:06,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:06" (3/3) ... [2024-10-24 21:45:06,473 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:06,491 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:45:06,491 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 21:45:06,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:45:06,555 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;@3cfd25d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:45:06,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 21:45:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 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-10-24 21:45:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 21:45:06,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:06,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:06,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 21:45:06,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash -133348598, now seen corresponding path program 1 times [2024-10-24 21:45:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:45:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989329441] [2024-10-24 21:45:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:45:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:45:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:45:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989329441] [2024-10-24 21:45:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989329441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:45:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:45:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:45:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220930597] [2024-10-24 21:45:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:45:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:45:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:45:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:45:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:45:06,942 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-24 21:45:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:07,005 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-24 21:45:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:45:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-10-24 21:45:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:07,015 INFO L225 Difference]: With dead ends: 49 [2024-10-24 21:45:07,016 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 21:45:07,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:45:07,023 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:07,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 21:45:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 21:45:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 22 states have internal predecessors, (25), 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-10-24 21:45:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-24 21:45:07,057 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2024-10-24 21:45:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:07,057 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-24 21:45:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-24 21:45:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-24 21:45:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 21:45:07,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:07,058 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:07,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 21:45:07,059 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-10-24 21:45:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash 256722690, now seen corresponding path program 1 times [2024-10-24 21:45:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:45:07,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791884324] [2024-10-24 21:45:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:45:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:45:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:45:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791884324] [2024-10-24 21:45:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791884324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 21:45:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719182890] [2024-10-24 21:45:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 21:45:07,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:45:07,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 21:45:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 21:45:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:07,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 21:45:07,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:45:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:07,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:45:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719182890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:45:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 21:45:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 21:45:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674673311] [2024-10-24 21:45:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:45:07,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 21:45:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:45:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 21:45:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 21:45:07,399 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-10-24 21:45:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:07,433 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-24 21:45:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 21:45:07,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-10-24 21:45:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:07,435 INFO L225 Difference]: With dead ends: 36 [2024-10-24 21:45:07,436 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 21:45:07,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 21:45:07,438 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:07,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 21:45:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 21:45:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 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-10-24 21:45:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-24 21:45:07,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2024-10-24 21:45:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-24 21:45:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-10-24 21:45:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-24 21:45:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 21:45:07,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:07,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:07,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 21:45:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 21:45:07,654 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-10-24 21:45:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1895887612, now seen corresponding path program 1 times [2024-10-24 21:45:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:45:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382266599] [2024-10-24 21:45:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:07,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:45:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 21:45:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 21:45:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382266599] [2024-10-24 21:45:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382266599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:45:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:45:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 21:45:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432162740] [2024-10-24 21:45:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:45:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 21:45:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 21:45:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 21:45:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:45:07,738 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:45:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:07,761 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-24 21:45:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 21:45:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 21:45:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:07,776 INFO L225 Difference]: With dead ends: 21 [2024-10-24 21:45:07,780 INFO L226 Difference]: Without dead ends: 20 [2024-10-24 21:45:07,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 21:45:07,781 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:07,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-24 21:45:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-24 21:45:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-10-24 21:45:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-24 21:45:07,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2024-10-24 21:45:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:07,794 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-24 21:45:07,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 21:45:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-24 21:45:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 21:45:07,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:07,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 21:45:07,799 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-10-24 21:45:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1357026100, now seen corresponding path program 1 times [2024-10-24 21:45:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 21:45:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507339282] [2024-10-24 21:45:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 21:45:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:45:07,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:45:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:45:07,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 21:45:07,903 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:45:07,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 21:45:07,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 21:45:07,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 21:45:07,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 21:45:07,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 21:45:07,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 21:45:07,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 21:45:07,915 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 21:45:07,940 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:45:07,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:45:07 BoogieIcfgContainer [2024-10-24 21:45:07,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:45:07,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:45:07,944 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:45:07,944 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:45:07,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:06" (3/4) ... [2024-10-24 21:45:07,947 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:45:07,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:45:07,949 INFO L158 Benchmark]: Toolchain (without parser) took 3105.25ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 85.4MB in the beginning and 157.8MB in the end (delta: -72.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:45:07,950 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:45:07,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1104.28ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 85.1MB in the beginning and 133.1MB in the end (delta: -48.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-10-24 21:45:07,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.90ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 129.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:45:07,952 INFO L158 Benchmark]: Boogie Preprocessor took 48.58ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:45:07,953 INFO L158 Benchmark]: RCFGBuilder took 394.08ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 112.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 21:45:07,953 INFO L158 Benchmark]: TraceAbstraction took 1478.96ms. Allocated memory is still 201.3MB. Free memory was 112.1MB in the beginning and 157.8MB in the end (delta: -45.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:45:07,953 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 201.3MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:45:07,954 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.21ms. Allocated memory is still 142.6MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1104.28ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 85.1MB in the beginning and 133.1MB in the end (delta: -48.0MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.90ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 129.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.58ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.08ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 112.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.96ms. Allocated memory is still 201.3MB. Free memory was 112.1MB in the beginning and 157.8MB in the end (delta: -45.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 201.3MB. Free memory is still 157.8MB. 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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_preinc_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 [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] [L1557] 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] [L1557] COND TRUE j < 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, j=0] [L1560] ++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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: 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, 26 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 55 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 21:45:07,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_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 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 21:45:10,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 21:45:10,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 21:45:10,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 21:45:10,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 21:45:10,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 21:45:10,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 21:45:10,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 21:45:10,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 21:45:10,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 21:45:10,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 21:45:10,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 21:45:10,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 21:45:10,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 21:45:10,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 21:45:10,388 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 21:45:10,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 21:45:10,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 21:45:10,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 21:45:10,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 21:45:10,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 21:45:10,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 21:45:10,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 21:45:10,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 21:45:10,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 21:45:10,395 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 21:45:10,398 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 21:45:10,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 21:45:10,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 21:45:10,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 21:45:10,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 21:45:10,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 21:45:10,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 21:45:10,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 21:45:10,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:45:10,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 21:45:10,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 21:45:10,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 21:45:10,401 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 21:45:10,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 21:45:10,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 21:45:10,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 21:45:10,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 21:45:10,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 21:45:10,403 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 21:45:10,403 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 -> 085331ab314de2d73cae0cdb8ff2481a405222bc5a60b60db694503dd434e6cf [2024-10-24 21:45:10,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 21:45:10,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 21:45:10,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 21:45:10,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 21:45:10,758 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 21:45:10,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:12,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 21:45:12,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 21:45:12,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:12,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2175f87/461b4096effa42c388fb7287d16694fe/FLAG6868deae4 [2024-10-24 21:45:12,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2175f87/461b4096effa42c388fb7287d16694fe [2024-10-24 21:45:12,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 21:45:12,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 21:45:12,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 21:45:12,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 21:45:12,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 21:45:12,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:12" (1/1) ... [2024-10-24 21:45:12,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e73649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:12, skipping insertion in model container [2024-10-24 21:45:12,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:45:12" (1/1) ... [2024-10-24 21:45:12,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 21:45:13,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:45:13,667 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 21:45:13,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 21:45:13,927 INFO L204 MainTranslator]: Completed translation [2024-10-24 21:45:13,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13 WrapperNode [2024-10-24 21:45:13,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 21:45:13,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 21:45:13,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 21:45:13,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 21:45:13,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:13,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:13,993 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-10-24 21:45:13,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 21:45:13,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 21:45:13,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 21:45:13,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 21:45:14,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,032 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 21:45:14,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 21:45:14,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 21:45:14,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 21:45:14,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 21:45:14,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (1/1) ... [2024-10-24 21:45:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 21:45:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 21:45:14,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 21:45:14,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 21:45:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 21:45:14,146 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 21:45:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 21:45:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 21:45:14,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 21:45:14,284 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 21:45:14,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 21:45:14,449 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-24 21:45:14,449 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 21:45:14,497 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 21:45:14,497 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 21:45:14,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:14 BoogieIcfgContainer [2024-10-24 21:45:14,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 21:45:14,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 21:45:14,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 21:45:14,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 21:45:14,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:45:12" (1/3) ... [2024-10-24 21:45:14,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d16d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:14, skipping insertion in model container [2024-10-24 21:45:14,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:45:13" (2/3) ... [2024-10-24 21:45:14,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d16d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:45:14, skipping insertion in model container [2024-10-24 21:45:14,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:14" (3/3) ... [2024-10-24 21:45:14,508 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_bad.i [2024-10-24 21:45:14,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 21:45:14,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 21:45:14,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 21:45:14,602 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;@27c8606a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 21:45:14,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 21:45:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 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-10-24 21:45:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 21:45:14,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:14,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:14,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 21:45:14,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash -133348598, now seen corresponding path program 1 times [2024-10-24 21:45:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:45:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434101126] [2024-10-24 21:45:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:14,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:14,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:45:14,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 21:45:14,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 21:45:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:14,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 21:45:14,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:45:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:14,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:45:14,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:45:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434101126] [2024-10-24 21:45:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434101126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:45:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:45:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 21:45:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661164297] [2024-10-24 21:45:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:45:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 21:45:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:45:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 21:45:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:45:14,849 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 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) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 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-10-24 21:45:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:14,879 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-24 21:45:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 21:45:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 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 9 [2024-10-24 21:45:14,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:14,889 INFO L225 Difference]: With dead ends: 42 [2024-10-24 21:45:14,890 INFO L226 Difference]: Without dead ends: 19 [2024-10-24 21:45:14,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 21:45:14,897 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:14,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-24 21:45:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-24 21:45:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 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-10-24 21:45:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-24 21:45:14,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2024-10-24 21:45:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:14,937 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-24 21:45:14,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 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-10-24 21:45:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-24 21:45:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 21:45:14,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:14,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:14,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 21:45:15,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:15,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 21:45:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 161160814, now seen corresponding path program 1 times [2024-10-24 21:45:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:45:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752941042] [2024-10-24 21:45:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:45:15,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 21:45:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 21:45:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:15,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 21:45:15,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:45:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:15,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 21:45:15,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:45:15,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752941042] [2024-10-24 21:45:15,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752941042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 21:45:15,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 21:45:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 21:45:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693119565] [2024-10-24 21:45:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 21:45:15,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 21:45:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:45:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 21:45:15,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:45:15,313 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 21:45:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:15,356 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-24 21:45:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 21:45:15,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-24 21:45:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:15,358 INFO L225 Difference]: With dead ends: 31 [2024-10-24 21:45:15,358 INFO L226 Difference]: Without dead ends: 22 [2024-10-24 21:45:15,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 21:45:15,360 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:15,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-24 21:45:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-24 21:45:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 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-10-24 21:45:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-24 21:45:15,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2024-10-24 21:45:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:15,369 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-24 21:45:15,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 21:45:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-24 21:45:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 21:45:15,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:15,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:15,376 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-10-24 21:45:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:15,572 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-10-24 21:45:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash -631531146, now seen corresponding path program 1 times [2024-10-24 21:45:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:45:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964107996] [2024-10-24 21:45:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:45:15,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 21:45:15,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 21:45:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 21:45:15,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 21:45:15,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 21:45:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:15,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 21:45:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 21:45:15,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 21:45:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964107996] [2024-10-24 21:45:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964107996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 21:45:15,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 21:45:15,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 21:45:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824105683] [2024-10-24 21:45:15,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 21:45:15,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 21:45:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 21:45:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 21:45:15,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 21:45:15,773 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10-24 21:45:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 21:45:15,827 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-24 21:45:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 21:45:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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 13 [2024-10-24 21:45:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 21:45:15,829 INFO L225 Difference]: With dead ends: 31 [2024-10-24 21:45:15,830 INFO L226 Difference]: Without dead ends: 19 [2024-10-24 21:45:15,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 21:45:15,831 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 21:45:15,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 21:45:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-24 21:45:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-24 21:45:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-10-24 21:45:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-24 21:45:15,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2024-10-24 21:45:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 21:45:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-24 21:45:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10-24 21:45:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-10-24 21:45:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 21:45:15,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 21:45:15,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 21:45:15,847 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-10-24 21:45:16,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:16,043 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-10-24 21:45:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 21:45:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1357026100, now seen corresponding path program 1 times [2024-10-24 21:45:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 21:45:16,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007058882] [2024-10-24 21:45:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 21:45:16,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 21:45:16,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 21:45:16,048 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-10-24 21:45:16,051 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-10-24 21:45:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:45:16,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 21:45:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 21:45:16,167 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 21:45:16,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 21:45:16,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 21:45:16,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 21:45:16,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 21:45:16,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 21:45:16,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 21:45:16,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 21:45:16,182 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-10-24 21:45:16,378 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-10-24 21:45:16,382 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 21:45:16,415 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 21:45:16,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:45:16 BoogieIcfgContainer [2024-10-24 21:45:16,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 21:45:16,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 21:45:16,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 21:45:16,426 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 21:45:16,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:45:14" (3/4) ... [2024-10-24 21:45:16,429 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 21:45:16,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 21:45:16,438 INFO L158 Benchmark]: Toolchain (without parser) took 3561.56ms. Allocated memory was 56.6MB in the beginning and 92.3MB in the end (delta: 35.7MB). Free memory was 35.4MB in the beginning and 60.6MB in the end (delta: -25.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,439 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 21:45:16,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1056.65ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 34.6MB in the end (delta: 641.6kB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.88ms. Allocated memory is still 75.5MB. Free memory was 34.2MB in the beginning and 31.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,439 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 75.5MB. Free memory was 31.2MB in the beginning and 28.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,440 INFO L158 Benchmark]: RCFGBuilder took 447.24ms. Allocated memory is still 75.5MB. Free memory was 28.7MB in the beginning and 32.7MB in the end (delta: -4.0MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,440 INFO L158 Benchmark]: TraceAbstraction took 1921.48ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 32.3MB in the beginning and 61.3MB in the end (delta: -29.0MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,440 INFO L158 Benchmark]: Witness Printer took 7.11ms. Allocated memory is still 92.3MB. Free memory was 61.3MB in the beginning and 60.6MB in the end (delta: 682.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 21:45:16,444 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.30ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.5MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1056.65ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 34.6MB in the end (delta: 641.6kB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.88ms. Allocated memory is still 75.5MB. Free memory was 34.2MB in the beginning and 31.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 75.5MB. Free memory was 31.2MB in the beginning and 28.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.24ms. Allocated memory is still 75.5MB. Free memory was 28.7MB in the beginning and 32.7MB in the end (delta: -4.0MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1921.48ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 32.3MB in the beginning and 61.3MB in the end (delta: -29.0MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 7.11ms. Allocated memory is still 92.3MB. Free memory was 61.3MB in the beginning and 60.6MB in the end (delta: 682.1kB). Peak memory consumption was 2.1MB. 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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_preinc_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 [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] [L1557] 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] [L1557] COND TRUE j < 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, j=0] [L1560] ++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: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: 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, 26 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 52 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 21:45:16,495 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