./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:38:34,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:38:34,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:38:34,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:38:34,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:38:34,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:38:34,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:38:34,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:38:34,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:38:34,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:38:34,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:38:34,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:38:34,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:38:34,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:38:34,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:38:34,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:38:34,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:38:34,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:38:34,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:38:34,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:38:34,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:38:34,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:38:34,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:38:34,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:38:34,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:38:34,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:38:34,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:38:34,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:38:34,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:38:34,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:38:34,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:38:34,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:38:34,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:38:34,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:38:34,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:38:34,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:38:34,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:38:34,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:38:34,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:38:34,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:38:34,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:38:34,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:38:34,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-10-13 03:38:34,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:38:34,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:38:34,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:38:34,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:38:34,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:38:34,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:36,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:38:36,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:38:36,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:36,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c1df50e/f29feec454e34d2fb14152c638b87044/FLAG23a4efe55 [2024-10-13 03:38:36,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c1df50e/f29feec454e34d2fb14152c638b87044 [2024-10-13 03:38:36,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:38:36,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:38:36,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:38:36,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:38:36,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:38:36,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e55f079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36, skipping insertion in model container [2024-10-13 03:38:36,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:38:36,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-13 03:38:36,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:38:36,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:38:36,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-13 03:38:36,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:38:36,808 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:38:36,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36 WrapperNode [2024-10-13 03:38:36,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:38:36,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:38:36,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:38:36,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:38:36,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,859 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-13 03:38:36,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:38:36,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:38:36,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:38:36,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:38:36,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,890 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-13 03:38:36,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:38:36,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:38:36,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:38:36,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:38:36,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (1/1) ... [2024-10-13 03:38:36,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:38:36,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:38:36,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:38:36,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:38:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:38:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:38:37,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:38:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:38:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:38:37,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:38:37,129 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:38:37,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:38:37,448 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:38:37,449 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:38:37,508 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:38:37,509 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:38:37,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:38:37 BoogieIcfgContainer [2024-10-13 03:38:37,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:38:37,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:38:37,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:38:37,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:38:37,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:38:36" (1/3) ... [2024-10-13 03:38:37,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320691b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:38:37, skipping insertion in model container [2024-10-13 03:38:37,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:36" (2/3) ... [2024-10-13 03:38:37,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320691b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:38:37, skipping insertion in model container [2024-10-13 03:38:37,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:38:37" (3/3) ... [2024-10-13 03:38:37,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:37,534 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:38:37,535 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:38:37,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:38:37,617 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;@19578ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:38:37,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:38:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:38:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 03:38:37,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:37,642 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:37,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1664830328, now seen corresponding path program 1 times [2024-10-13 03:38:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:38:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174201380] [2024-10-13 03:38:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:38:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:38:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:38:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:38:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:38:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:38:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:38:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:38:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:38:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:38:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:38:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:38:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:38:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:38:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:38:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:38:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:38:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:38:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:38:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:38:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:38:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:38:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:38:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:38:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:38:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174201380] [2024-10-13 03:38:38,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174201380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:38:38,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:38:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:38:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857410068] [2024-10-13 03:38:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:38:38,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:38:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:38:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:38:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:38:38,214 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:38:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:38:38,271 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2024-10-13 03:38:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:38:38,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 131 [2024-10-13 03:38:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:38:38,292 INFO L225 Difference]: With dead ends: 107 [2024-10-13 03:38:38,292 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 03:38:38,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-13 03:38:38,302 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:38:38,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:38:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 03:38:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 03:38:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:38:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-13 03:38:38,357 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 131 [2024-10-13 03:38:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:38:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-13 03:38:38,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:38:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-13 03:38:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 03:38:38,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:38,362 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:38:38,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1120922168, now seen corresponding path program 1 times [2024-10-13 03:38:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:38:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542258141] [2024-10-13 03:38:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:38:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:38:38,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:38:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:38:38,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:38:38,645 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:38:38,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:38:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:38:38,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 03:38:38,775 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:38:38,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:38:38 BoogieIcfgContainer [2024-10-13 03:38:38,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:38:38,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:38:38,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:38:38,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:38:38,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:38:37" (3/4) ... [2024-10-13 03:38:38,786 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:38:38,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:38:38,790 INFO L158 Benchmark]: Toolchain (without parser) took 2364.00ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 41.1MB in the end (delta: 74.4MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,791 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:38:38,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.52ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 101.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.44ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,794 INFO L158 Benchmark]: Boogie Preprocessor took 45.45ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,795 INFO L158 Benchmark]: RCFGBuilder took 601.33ms. Allocated memory is still 153.1MB. Free memory was 97.8MB in the beginning and 110.3MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,795 INFO L158 Benchmark]: TraceAbstraction took 1269.70ms. Allocated memory is still 153.1MB. Free memory was 110.0MB in the beginning and 42.0MB in the end (delta: 68.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-13 03:38:38,795 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 153.1MB. Free memory was 42.0MB in the beginning and 41.1MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:38:38,800 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.52ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 101.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.44ms. Allocated memory is still 153.1MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.45ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.33ms. Allocated memory is still 153.1MB. Free memory was 97.8MB in the beginning and 110.3MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1269.70ms. Allocated memory is still 153.1MB. Free memory was 110.0MB in the beginning and 42.0MB in the end (delta: 68.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 153.1MB. Free memory was 42.0MB in the beginning and 41.1MB in the end (delta: 932.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] signed long int var_1_2 = 64; [L24] signed long int var_1_3 = 31; [L25] signed long int var_1_4 = 1; [L26] unsigned char var_1_5 = 2; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 1; [L31] signed long int var_1_10 = 64; [L32] signed long int var_1_11 = 32; [L33] signed long int var_1_12 = 10; [L34] signed long int var_1_13 = 4; [L35] signed long int var_1_14 = 999; [L36] signed long int var_1_15 = 2; [L37] signed long int var_1_16 = 8; [L38] signed long int last_1_var_1_16 = 8; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_16 = var_1_16 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=31, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 255) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=10, var_1_7=5, var_1_8=1, var_1_9=1] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=64, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L86] var_1_10 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L88] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=32, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L89] var_1_11 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L91] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=10, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L92] var_1_12 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L93] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L94] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=4, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L95] var_1_13 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L96] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L97] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=999, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L98] var_1_14 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L99] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L100] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=9999, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L114] RET updateVariables() [L115] CALL step() [L42] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L43] COND FALSE !((- var_1_5) >= var_1_6) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L52] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_16=8, stepLocal_0=-255, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=5, var_1_8=1, var_1_9=-255] [L53] COND TRUE var_1_8 && stepLocal_0 [L54] var_1_7 = ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=2, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L56] var_1_15 = 500.25 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=8, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L57] COND FALSE !(var_1_2 > last_1_var_1_16) [L64] var_1_16 = var_1_12 VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((var_1_1 == ((signed long int) (var_1_2 - var_1_3))) && (((- var_1_5) >= var_1_6) ? ((var_1_6 > var_1_5) ? ((var_1_3 == var_1_1) ? (var_1_4 == ((signed long int) (256 - (var_1_5 + 5)))) : (var_1_4 == ((signed long int) var_1_5))) : 1) : 1)) && ((var_1_8 && var_1_9) ? (var_1_7 == ((signed long int) ((var_1_10 - var_1_11) + (var_1_12 + (var_1_13 + var_1_14))))) : 1)) && (var_1_15 == ((signed long int) 500.25))) && ((var_1_2 > last_1_var_1_16) ? (var_1_9 ? ((var_1_3 <= ((((last_1_var_1_16) < (var_1_11)) ? (last_1_var_1_16) : (var_1_11)))) ? (var_1_16 == ((signed long int) (var_1_14 + var_1_11))) : 1) : 1) : (var_1_16 == ((signed long int) var_1_12))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=10000, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=8, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_15=10000, var_1_16=0, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=5, var_1_7=0, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 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-13 03:38:38,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:38:41,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:38:41,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:38:41,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:38:41,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:38:41,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:38:41,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:38:41,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:38:41,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:38:41,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:38:41,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:38:41,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:38:41,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:38:41,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:38:41,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:38:41,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:38:41,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:38:41,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:38:41,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:38:41,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:38:41,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:38:41,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:38:41,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:38:41,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:38:41,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:38:41,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:38:41,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:38:41,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:38:41,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:38:41,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:38:41,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:38:41,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:38:41,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:38:41,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:38:41,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:38:41,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:38:41,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:38:41,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:38:41,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:38:41,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:38:41,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:38:41,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:38:41,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:38:41,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:38:41,372 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:38:41,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 06dfea34f20cf44667f72790239eb3b7ea493d794e5649e0b17ceb748f3093ee [2024-10-13 03:38:41,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:38:41,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:38:41,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:38:41,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:38:41,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:38:41,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:43,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:38:43,705 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:38:43,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:43,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b6ca68b/177d74abdcd046639fb2bf2bf9d171f3/FLAG8750fc9d5 [2024-10-13 03:38:44,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b6ca68b/177d74abdcd046639fb2bf2bf9d171f3 [2024-10-13 03:38:44,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:38:44,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:38:44,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:38:44,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:38:44,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:38:44,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6255a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44, skipping insertion in model container [2024-10-13 03:38:44,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:38:44,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-13 03:38:44,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:38:44,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:38:44,407 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-60.i[916,929] [2024-10-13 03:38:44,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:38:44,468 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:38:44,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44 WrapperNode [2024-10-13 03:38:44,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:38:44,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:38:44,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:38:44,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:38:44,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,524 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-13 03:38:44,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:38:44,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:38:44,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:38:44,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:38:44,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,562 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-13 03:38:44,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:38:44,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:38:44,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:38:44,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:38:44,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (1/1) ... [2024-10-13 03:38:44,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:38:44,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:38:44,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:38:44,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:38:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:38:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:38:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:38:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:38:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:38:44,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:38:44,773 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:38:44,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:38:45,125 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:38:45,125 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:38:45,174 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:38:45,174 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:38:45,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:38:45 BoogieIcfgContainer [2024-10-13 03:38:45,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:38:45,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:38:45,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:38:45,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:38:45,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:38:44" (1/3) ... [2024-10-13 03:38:45,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347582e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:38:45, skipping insertion in model container [2024-10-13 03:38:45,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:38:44" (2/3) ... [2024-10-13 03:38:45,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347582e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:38:45, skipping insertion in model container [2024-10-13 03:38:45,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:38:45" (3/3) ... [2024-10-13 03:38:45,185 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-60.i [2024-10-13 03:38:45,201 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:38:45,202 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:38:45,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:38:45,300 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;@6d9951cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:38:45,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:38:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:38:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 03:38:45,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:45,321 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:45,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:45,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1664830328, now seen corresponding path program 1 times [2024-10-13 03:38:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:38:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303076676] [2024-10-13 03:38:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:45,345 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-13 03:38:45,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:38:45,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:38:45,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:38:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:45,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:38:45,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:38:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-13 03:38:45,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:38:45,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:38:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303076676] [2024-10-13 03:38:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303076676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:38:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:38:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:38:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69404787] [2024-10-13 03:38:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:38:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:38:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:38:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:38:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:38:45,671 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:38:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:38:45,725 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2024-10-13 03:38:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:38:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 131 [2024-10-13 03:38:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:38:45,741 INFO L225 Difference]: With dead ends: 107 [2024-10-13 03:38:45,742 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 03:38:45,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-13 03:38:45,765 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:38:45,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:38:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 03:38:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 03:38:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:38:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-13 03:38:45,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 131 [2024-10-13 03:38:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:38:45,830 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-13 03:38:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:38:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-13 03:38:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 03:38:45,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:45,834 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:45,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:38:46,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:38:46,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1120922168, now seen corresponding path program 1 times [2024-10-13 03:38:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:38:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906075547] [2024-10-13 03:38:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:46,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:38:46,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:38:46,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:38:46,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:38:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:46,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:38:46,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:39:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:39:03,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:39:03,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:39:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906075547] [2024-10-13 03:39:03,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906075547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:03,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:39:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028149818] [2024-10-13 03:39:03,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:03,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:39:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:39:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:39:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:39:03,266 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:39:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:03,896 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2024-10-13 03:39:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:39:03,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 131 [2024-10-13 03:39:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:03,902 INFO L225 Difference]: With dead ends: 82 [2024-10-13 03:39:03,902 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 03:39:03,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:39:03,906 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:03,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 259 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:39:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 03:39:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2024-10-13 03:39:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:39:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-13 03:39:03,917 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 131 [2024-10-13 03:39:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:03,919 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-13 03:39:03,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:39:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-13 03:39:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 03:39:03,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:03,924 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:39:03,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:39:04,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:39:04,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:04,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1178180470, now seen corresponding path program 1 times [2024-10-13 03:39:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:39:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083878741] [2024-10-13 03:39:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:04,132 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-13 03:39:04,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:39:04,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:39:04,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:39:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:04,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 03:39:04,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:39:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-10-13 03:39:31,973 INFO L311 TraceCheckSpWp]: Computing backward predicates...