./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash d2d6f9be66d27a1c9d3b3eaba0ccd86a9e6d263d5b40883199c2e280efc7ebbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:49:12,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:49:12,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:49:12,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:49:12,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:49:12,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:49:12,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:49:12,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:49:12,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:49:12,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:49:12,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:49:12,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:49:12,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:49:12,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:49:12,929 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:49:12,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:49:12,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:49:12,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:49:12,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:49:12,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:49:12,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:49:12,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:49:12,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:49:12,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:49:12,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:49:12,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:49:12,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:49:12,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:49:12,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:49:12,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:12,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:49:12,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:49:12,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:49:12,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:49:12,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:49:12,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:49:12,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:49:12,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:49:12,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:49:12,938 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2d6f9be66d27a1c9d3b3eaba0ccd86a9e6d263d5b40883199c2e280efc7ebbe [2024-10-11 20:49:13,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:49:13,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:49:13,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:49:13,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:49:13,198 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:49:13,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c [2024-10-11 20:49:14,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:49:14,750 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:49:14,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c [2024-10-11 20:49:14,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f45c51570/3fec084b3ab440369e5dd38e260eac4a/FLAG43511cf61 [2024-10-11 20:49:15,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f45c51570/3fec084b3ab440369e5dd38e260eac4a [2024-10-11 20:49:15,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:49:15,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:49:15,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:15,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:49:15,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:49:15,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6f281c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15, skipping insertion in model container [2024-10-11 20:49:15,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:49:15,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:15,330 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:49:15,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:15,369 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:49:15,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15 WrapperNode [2024-10-11 20:49:15,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:15,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:15,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:49:15,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:49:15,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,408 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-10-11 20:49:15,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:15,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:49:15,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:49:15,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:49:15,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,438 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:49:15,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:49:15,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:49:15,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:49:15,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:49:15,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (1/1) ... [2024-10-11 20:49:15,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:15,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:49:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:49:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:49:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:49:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:49:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:49:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:49:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:49:15,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:49:15,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:49:16,002 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-10-11 20:49:16,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:49:16,042 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:49:16,042 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:49:16,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:16 BoogieIcfgContainer [2024-10-11 20:49:16,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:49:16,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:49:16,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:49:16,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:49:16,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:49:15" (1/3) ... [2024-10-11 20:49:16,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328ecd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:16, skipping insertion in model container [2024-10-11 20:49:16,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:15" (2/3) ... [2024-10-11 20:49:16,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328ecd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:16, skipping insertion in model container [2024-10-11 20:49:16,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:16" (3/3) ... [2024-10-11 20:49:16,054 INFO L112 eAbstractionObserver]: Analyzing ICFG freire2_valuebound2.c [2024-10-11 20:49:16,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:49:16,067 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-10-11 20:49:16,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:49:16,133 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;@52b72440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:49:16,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-11 20:49:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 129 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:49:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:49:16,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:16,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:49:16,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:49:16,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash 197791688, now seen corresponding path program 1 times [2024-10-11 20:49:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:16,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300964255] [2024-10-11 20:49:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:16,261 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-11 20:49:16,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300964255] [2024-10-11 20:49:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300964255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:16,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:16,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:49:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046424819] [2024-10-11 20:49:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:16,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:49:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:49:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:49:16,296 INFO L87 Difference]: Start difference. First operand has 137 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 129 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:16,335 INFO L93 Difference]: Finished difference Result 266 states and 295 transitions. [2024-10-11 20:49:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:49:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:49:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:16,344 INFO L225 Difference]: With dead ends: 266 [2024-10-11 20:49:16,344 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 20:49:16,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 20:49:16,350 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:16,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:49:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 20:49:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 20:49:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.7941176470588236) internal successors, (122), 121 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:49:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2024-10-11 20:49:16,441 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 5 [2024-10-11 20:49:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2024-10-11 20:49:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2024-10-11 20:49:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:49:16,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:16,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:49:16,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:49:16,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:49:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 197851257, now seen corresponding path program 1 times [2024-10-11 20:49:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403127218] [2024-10-11 20:49:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:16,508 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-11 20:49:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:49:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403127218] [2024-10-11 20:49:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403127218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:49:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938205791] [2024-10-11 20:49:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:16,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:49:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:49:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:49:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:49:16,516 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:16,861 INFO L93 Difference]: Finished difference Result 241 states and 258 transitions. [2024-10-11 20:49:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:49:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:49:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:16,863 INFO L225 Difference]: With dead ends: 241 [2024-10-11 20:49:16,863 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 20:49:16,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:49:16,867 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:16,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 81 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:49:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 20:49:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-11 20:49:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 126 states have (on average 1.492063492063492) internal successors, (188), 179 states have internal predecessors, (188), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:49:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2024-10-11 20:49:16,893 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 5 [2024-10-11 20:49:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:16,893 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2024-10-11 20:49:16,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2024-10-11 20:49:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:49:16,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:16,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:49:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:49:16,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:49:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1001355011, now seen corresponding path program 1 times [2024-10-11 20:49:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:49:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853240466] [2024-10-11 20:49:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:49:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:49:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408158197] [2024-10-11 20:49:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:16,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:16,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:49:16,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:49:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:49:16,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:49:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:49:17,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:49:17,001 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:49:17,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 60 remaining) [2024-10-11 20:49:17,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 60 remaining) [2024-10-11 20:49:17,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 60 remaining) [2024-10-11 20:49:17,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 60 remaining) [2024-10-11 20:49:17,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 60 remaining) [2024-10-11 20:49:17,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 60 remaining) [2024-10-11 20:49:17,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 60 remaining) [2024-10-11 20:49:17,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 60 remaining) [2024-10-11 20:49:17,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 60 remaining) [2024-10-11 20:49:17,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 60 remaining) [2024-10-11 20:49:17,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 60 remaining) [2024-10-11 20:49:17,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 60 remaining) [2024-10-11 20:49:17,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 60 remaining) [2024-10-11 20:49:17,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 60 remaining) [2024-10-11 20:49:17,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 60 remaining) [2024-10-11 20:49:17,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 60 remaining) [2024-10-11 20:49:17,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 60 remaining) [2024-10-11 20:49:17,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 60 remaining) [2024-10-11 20:49:17,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 60 remaining) [2024-10-11 20:49:17,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 60 remaining) [2024-10-11 20:49:17,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 60 remaining) [2024-10-11 20:49:17,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 60 remaining) [2024-10-11 20:49:17,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 60 remaining) [2024-10-11 20:49:17,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 60 remaining) [2024-10-11 20:49:17,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 60 remaining) [2024-10-11 20:49:17,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 60 remaining) [2024-10-11 20:49:17,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 60 remaining) [2024-10-11 20:49:17,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 60 remaining) [2024-10-11 20:49:17,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 60 remaining) [2024-10-11 20:49:17,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 60 remaining) [2024-10-11 20:49:17,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 60 remaining) [2024-10-11 20:49:17,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 60 remaining) [2024-10-11 20:49:17,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 60 remaining) [2024-10-11 20:49:17,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 60 remaining) [2024-10-11 20:49:17,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 60 remaining) [2024-10-11 20:49:17,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 60 remaining) [2024-10-11 20:49:17,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 60 remaining) [2024-10-11 20:49:17,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 60 remaining) [2024-10-11 20:49:17,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 60 remaining) [2024-10-11 20:49:17,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 60 remaining) [2024-10-11 20:49:17,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 60 remaining) [2024-10-11 20:49:17,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 60 remaining) [2024-10-11 20:49:17,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 60 remaining) [2024-10-11 20:49:17,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 60 remaining) [2024-10-11 20:49:17,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 60 remaining) [2024-10-11 20:49:17,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 60 remaining) [2024-10-11 20:49:17,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 60 remaining) [2024-10-11 20:49:17,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 60 remaining) [2024-10-11 20:49:17,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 60 remaining) [2024-10-11 20:49:17,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:49:17,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:49:17,232 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 20:49:17,244 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:49:17,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:49:17 BoogieIcfgContainer [2024-10-11 20:49:17,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:49:17,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:49:17,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:49:17,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:49:17,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:16" (3/4) ... [2024-10-11 20:49:17,250 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 20:49:17,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:49:17,252 INFO L158 Benchmark]: Toolchain (without parser) took 2105.92ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 80.0MB in the end (delta: 35.1MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,252 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:49:17,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.79ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 102.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,253 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,253 INFO L158 Benchmark]: RCFGBuilder took 592.85ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 74.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,253 INFO L158 Benchmark]: TraceAbstraction took 1200.67ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 80.7MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:49:17,254 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 80.0MB in the end (delta: 701.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:49:17,255 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.96ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.79ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 102.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.85ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 74.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1200.67ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 80.7MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 80.0MB in the end (delta: 701.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: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of to_int at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L25] int r; [L26] double a, x, s; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=2) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=2) [L29] x = a [L30] s = 3.25 [L31] r = 1 VAL [r=1] [L33] COND TRUE 1 VAL [r=1] [L34] EXPR 12*r VAL [r=1] [L34] EXPR 12*r*r VAL [r=1] [L34] (int)(4*s) - 12*r*r - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: 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, 137 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 198 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 20:49:17,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash d2d6f9be66d27a1c9d3b3eaba0ccd86a9e6d263d5b40883199c2e280efc7ebbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:49:19,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:49:19,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-11 20:49:19,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:49:19,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:49:19,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:49:19,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:49:19,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:49:19,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:49:19,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:49:19,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:49:19,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:49:19,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:49:19,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:49:19,561 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:49:19,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:49:19,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:49:19,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:49:19,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:49:19,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:49:19,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:49:19,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:49:19,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:49:19,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:49:19,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 20:49:19,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:49:19,567 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:49:19,567 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 20:49:19,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:49:19,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:49:19,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:49:19,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:49:19,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:49:19,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:49:19,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:49:19,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:49:19,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:19,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:49:19,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:49:19,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:49:19,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 20:49:19,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 20:49:19,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:49:19,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:49:19,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:49:19,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:49:19,573 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 20:49:19,573 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2d6f9be66d27a1c9d3b3eaba0ccd86a9e6d263d5b40883199c2e280efc7ebbe [2024-10-11 20:49:19,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:49:19,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:49:19,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:49:19,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:49:19,934 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:49:19,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c [2024-10-11 20:49:21,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:49:21,647 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:49:21,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire2_valuebound2.c [2024-10-11 20:49:21,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/995c269b8/7bed31bf9b6d48e29de6a57c76066c7f/FLAGe71d47f05 [2024-10-11 20:49:21,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/995c269b8/7bed31bf9b6d48e29de6a57c76066c7f [2024-10-11 20:49:21,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:49:21,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:49:21,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:21,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:49:21,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:49:21,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:21,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278f176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21, skipping insertion in model container [2024-10-11 20:49:21,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:21,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:49:21,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:21,928 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:49:21,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:49:21,979 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:49:21,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21 WrapperNode [2024-10-11 20:49:21,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:49:21,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:21,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:49:21,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:49:21,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,041 INFO L138 Inliner]: procedures = 15, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2024-10-11 20:49:22,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:49:22,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:49:22,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:49:22,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:49:22,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,077 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:49:22,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:49:22,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:49:22,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:49:22,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:49:22,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (1/1) ... [2024-10-11 20:49:22,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:49:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:49:22,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:49:22,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:49:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:49:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 20:49:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:49:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:49:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:49:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:49:22,253 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:49:22,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:49:53,560 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-11 20:49:53,560 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:49:53,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:49:53,603 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:49:53,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:53 BoogieIcfgContainer [2024-10-11 20:49:53,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:49:53,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:49:53,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:49:53,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:49:53,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:49:21" (1/3) ... [2024-10-11 20:49:53,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4922030d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:53, skipping insertion in model container [2024-10-11 20:49:53,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:49:21" (2/3) ... [2024-10-11 20:49:53,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4922030d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:49:53, skipping insertion in model container [2024-10-11 20:49:53,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:49:53" (3/3) ... [2024-10-11 20:49:53,614 INFO L112 eAbstractionObserver]: Analyzing ICFG freire2_valuebound2.c [2024-10-11 20:49:53,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:49:53,640 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-10-11 20:49:53,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:49:53,707 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;@4f0036d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:49:53,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-11 20:49:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 129 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:49:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:49:53,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:53,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:49:53,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:49:53,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 197791688, now seen corresponding path program 1 times [2024-10-11 20:49:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:49:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849560526] [2024-10-11 20:49:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:53,731 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-11 20:49:53,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:49:53,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 20:49:53,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 20:49:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:53,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 20:49:53,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:53,830 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-11 20:49:53,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:49:53,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:49:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849560526] [2024-10-11 20:49:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849560526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:53,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:49:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37074450] [2024-10-11 20:49:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:53,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:49:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:49:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:49:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:49:53,870 INFO L87 Difference]: Start difference. First operand has 137 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 129 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:49:53,923 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2024-10-11 20:49:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:49:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:49:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:49:53,935 INFO L225 Difference]: With dead ends: 271 [2024-10-11 20:49:53,935 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 20:49:53,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-11 20:49:53,944 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:49:53,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:49:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 20:49:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 20:49:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 126 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:49:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2024-10-11 20:49:53,987 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 5 [2024-10-11 20:49:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:49:53,987 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2024-10-11 20:49:53,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2024-10-11 20:49:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:49:53,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:49:53,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:49:53,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 20:49:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 20:49:54,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:49:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:49:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 197851257, now seen corresponding path program 1 times [2024-10-11 20:49:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:49:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788259776] [2024-10-11 20:49:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:49:54,192 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-11 20:49:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:49:54,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 20:49:54,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 20:49:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:49:54,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:49:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:49:54,267 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-11 20:49:54,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:49:54,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:49:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788259776] [2024-10-11 20:49:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788259776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:49:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:49:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:49:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560811644] [2024-10-11 20:49:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:49:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:49:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:49:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:49:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:49:54,272 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:49:58,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:02,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:05,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:08,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:17,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:20,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:23,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:26,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:28,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:32,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:33,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:39,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:42,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:46,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:50:46,268 INFO L93 Difference]: Finished difference Result 255 states and 268 transitions. [2024-10-11 20:50:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:50:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:50:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:50:46,272 INFO L225 Difference]: With dead ends: 255 [2024-10-11 20:50:46,272 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 20:50:46,272 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-11 20:50:46,277 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:50:46,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 91 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 51.9s Time] [2024-10-11 20:50:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 20:50:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 20:50:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 126 states have (on average 1.5) internal successors, (189), 184 states have internal predecessors, (189), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:50:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2024-10-11 20:50:46,306 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 207 transitions. Word has length 5 [2024-10-11 20:50:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:50:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 207 transitions. [2024-10-11 20:50:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:50:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 207 transitions. [2024-10-11 20:50:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:50:46,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:50:46,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:50:46,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 20:50:46,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 20:50:46,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2024-10-11 20:50:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:50:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1001355011, now seen corresponding path program 1 times [2024-10-11 20:50:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:50:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086789759] [2024-10-11 20:50:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:50:46,510 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-11 20:50:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:50:46,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 20:50:46,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 20:50:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:50:46,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:50:46,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:50:46,889 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-11 20:50:46,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:50:46,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:50:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086789759] [2024-10-11 20:50:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086789759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:50:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:50:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:50:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343396982] [2024-10-11 20:50:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:50:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:50:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:50:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:50:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:50:46,892 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:50:50,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:53,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:50:56,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []