./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.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 26889e4c825bc9df5f6bfdada4995dbeaf45a1d31e009b603ffadcd3ffbc80b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:51:31,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:51:31,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:51:31,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:51:31,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:51:31,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:51:31,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:51:31,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:51:31,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:51:31,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:51:31,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:51:31,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:51:31,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:51:31,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:51:31,966 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:51:31,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:51:31,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:51:31,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:51:31,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:51:31,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:51:31,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:51:31,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:51:31,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:51:31,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:51:31,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:51:31,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:51:31,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:51:31,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:51:31,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:51:31,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:51:31,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:51:31,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:51:31,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:31,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:51:31,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:51:31,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:51:31,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:51:31,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:51:31,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:51:31,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:51:31,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:51:31,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:51:31,979 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 -> 26889e4c825bc9df5f6bfdada4995dbeaf45a1d31e009b603ffadcd3ffbc80b6 [2024-11-10 06:51:32,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:51:32,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:51:32,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:51:32,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:51:32,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:51:32,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:33,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:51:33,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:51:33,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:33,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebc66f09/0df98174e47a4788a19c29fd2c52d2f3/FLAG3b5245960 [2024-11-10 06:51:33,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebc66f09/0df98174e47a4788a19c29fd2c52d2f3 [2024-11-10 06:51:33,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:51:33,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:51:33,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:33,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:51:33,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:51:33,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:33" (1/1) ... [2024-11-10 06:51:33,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223eba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:33, skipping insertion in model container [2024-11-10 06:51:33,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:33" (1/1) ... [2024-11-10 06:51:33,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:51:34,151 WARN L250 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-26.i[916,929] [2024-11-10 06:51:34,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:34,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:51:34,222 WARN L250 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-26.i[916,929] [2024-11-10 06:51:34,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:34,270 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:51:34,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34 WrapperNode [2024-11-10 06:51:34,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:34,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:34,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:51:34,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:51:34,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,341 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-10 06:51:34,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:34,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:51:34,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:51:34,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:51:34,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,397 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-11-10 06:51:34,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:51:34,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:51:34,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:51:34,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:51:34,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (1/1) ... [2024-11-10 06:51:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:34,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:51:34,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:51:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:51:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:51:34,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:51:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:51:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:51:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:51:34,602 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:51:34,604 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:51:34,893 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:51:34,894 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:51:34,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:51:34,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:51:34,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:34 BoogieIcfgContainer [2024-11-10 06:51:34,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:51:34,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:51:34,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:51:34,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:51:34,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:33" (1/3) ... [2024-11-10 06:51:34,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d56857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:34, skipping insertion in model container [2024-11-10 06:51:34,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:34" (2/3) ... [2024-11-10 06:51:34,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d56857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:34, skipping insertion in model container [2024-11-10 06:51:34,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:34" (3/3) ... [2024-11-10 06:51:34,927 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:34,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:51:34,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:51:35,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:51:35,041 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;@21d10a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:51:35,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:51:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 06:51:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 06:51:35,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:35,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 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-11-10 06:51:35,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash 28832555, now seen corresponding path program 1 times [2024-11-10 06:51:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:51:35,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429026030] [2024-11-10 06:51:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:51:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:51:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:51:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:51:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:51:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:51:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:51:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:51:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:51:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:51:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:51:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:51:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 06:51:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:51:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429026030] [2024-11-10 06:51:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429026030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:51:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448151784] [2024-11-10 06:51:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:35,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:51:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:51:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:51:35,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:35,483 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 06:51:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:35,503 INFO L93 Difference]: Finished difference Result 78 states and 122 transitions. [2024-11-10 06:51:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:51:35,505 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-10 06:51:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:35,513 INFO L225 Difference]: With dead ends: 78 [2024-11-10 06:51:35,513 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 06:51:35,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:35,519 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:35,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:51:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 06:51:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 06:51:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 06:51:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-10 06:51:35,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 76 [2024-11-10 06:51:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:35,561 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-10 06:51:35,561 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 06:51:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-10 06:51:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 06:51:35,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:35,564 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 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-11-10 06:51:35,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:51:35,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1507188151, now seen corresponding path program 1 times [2024-11-10 06:51:35,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:51:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484881515] [2024-11-10 06:51:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:51:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:51:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526213774] [2024-11-10 06:51:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:51:35,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:35,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:51:35,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:51:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:35,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:51:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:36,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:51:36,042 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:51:36,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:51:36,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:51:36,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:51:36,251 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 06:51:36,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:51:36,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:51:36 BoogieIcfgContainer [2024-11-10 06:51:36,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:51:36,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:51:36,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:51:36,322 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:51:36,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:34" (3/4) ... [2024-11-10 06:51:36,325 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:51:36,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:51:36,327 INFO L158 Benchmark]: Toolchain (without parser) took 2371.02ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 110.7MB in the beginning and 181.4MB in the end (delta: -70.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-10 06:51:36,330 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:36,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.30ms. Allocated memory is still 169.9MB. Free memory was 110.7MB in the beginning and 96.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:51:36,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.27ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 91.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:51:36,331 INFO L158 Benchmark]: Boogie Preprocessor took 77.51ms. Allocated memory is still 169.9MB. Free memory was 91.8MB in the beginning and 84.0MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:51:36,331 INFO L158 Benchmark]: IcfgBuilder took 492.93ms. Allocated memory is still 169.9MB. Free memory was 84.0MB in the beginning and 65.2MB in the end (delta: 18.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 06:51:36,332 INFO L158 Benchmark]: TraceAbstraction took 1401.16ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 64.5MB in the beginning and 181.4MB in the end (delta: -116.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:36,332 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 249.6MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:51:36,334 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.20ms. Allocated memory is still 169.9MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.30ms. Allocated memory is still 169.9MB. Free memory was 110.7MB in the beginning and 96.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.27ms. Allocated memory is still 169.9MB. Free memory was 96.0MB in the beginning and 91.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.51ms. Allocated memory is still 169.9MB. Free memory was 91.8MB in the beginning and 84.0MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 492.93ms. Allocated memory is still 169.9MB. Free memory was 84.0MB in the beginning and 65.2MB in the end (delta: 18.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1401.16ms. Allocated memory was 169.9MB in the beginning and 249.6MB in the end (delta: 79.7MB). Free memory was 64.5MB in the beginning and 181.4MB in the end (delta: -116.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 249.6MB. Free memory is still 181.4MB. 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 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] signed short int var_1_4 = 1; [L24] signed long int var_1_12 = 1; [L25] signed long int var_1_13 = 199; [L26] signed long int var_1_14 = 2000000000; [L27] unsigned char var_1_15 = 64; [L28] unsigned char var_1_16 = 2; [L29] unsigned long int var_1_17 = 50; [L30] signed long int var_1_19 = -32; [L31] signed long int var_1_20 = 8; [L32] unsigned char last_1_var_1_15 = 64; VAL [isInitial=0, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=1] [L77] isInitial = 1 [L78] FCALL initially() [L79] COND TRUE 1 [L80] CALL updateLastVariables() [L70] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=1] [L80] RET updateLastVariables() [L81] CALL updateVariables() [L52] var_1_4 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L53] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L54] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L54] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=199, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L55] var_1_13 = __VERIFIER_nondet_long() [L56] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L56] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L57] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L57] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=2000000000, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L58] var_1_14 = __VERIFIER_nondet_long() [L59] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L59] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L60] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L60] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=2, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L61] var_1_16 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L62] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L63] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L63] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-32, var_1_1=-1, var_1_20=8, var_1_4=-256] [L64] var_1_19 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L65] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L66] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L66] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L67] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L67] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=1, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L81] RET updateVariables() [L82] CALL step() [L36] var_1_12 = ((0.85f - var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=0, var_1_14=-2147483648, var_1_15=64, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L37] COND TRUE (- last_1_var_1_15) >= (var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4)))) [L38] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=64, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=8, var_1_4=-256] [L40] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_15=64, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=-1, var_1_20=0, var_1_4=-256] [L41] COND FALSE !(var_1_20 > var_1_20) [L44] var_1_1 = (((((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) < ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))) ? ((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] [L46] signed long int stepLocal_0 = var_1_15 + (var_1_15 + var_1_1); VAL [isInitial=1, last_1_var_1_15=64, stepLocal_0=22, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=50, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] [L47] COND TRUE stepLocal_0 != (var_1_15 * (var_1_1 / var_1_19)) [L48] var_1_17 = (((((10u) < ((var_1_1 + var_1_15))) ? (10u) : ((var_1_1 + var_1_15)))) + var_1_15) VAL [isInitial=1, last_1_var_1_15=64, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=21, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] [L82] RET step() [L83] CALL, EXPR property() [L73-L74] return (((((var_1_20 > var_1_20) ? (var_1_1 == ((signed short int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : (var_1_1 == ((signed short int) (((((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) < ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))) ? ((var_1_15 - ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : ((var_1_15 + ((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15)))))))))) && (var_1_12 == ((signed long int) ((0.85f - var_1_13) + var_1_14)))) && (((- last_1_var_1_15) >= (var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && (((var_1_15 + (var_1_15 + var_1_1)) != (var_1_15 * (var_1_1 / var_1_19))) ? (var_1_17 == ((unsigned long int) (((((10u) < ((var_1_1 + var_1_15))) ? (10u) : ((var_1_1 + var_1_15)))) + var_1_15))) : 1)) && (var_1_20 == ((signed long int) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=64, var_1_12=17, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=21, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] [L83] RET, EXPR property() [L83] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=64, var_1_12=17, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=21, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=64, var_1_12=17, var_1_13=0, var_1_14=-2147483648, var_1_15=11, var_1_16=11, var_1_17=21, var_1_19=-2147483648, var_1_1=0, var_1_20=0, var_1_4=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 11, 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, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 50 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:51:36,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.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 26889e4c825bc9df5f6bfdada4995dbeaf45a1d31e009b603ffadcd3ffbc80b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:51:38,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:51:38,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:51:38,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:51:38,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:51:38,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:51:38,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:51:38,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:51:38,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:51:38,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:51:38,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:51:38,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:51:38,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:51:38,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:51:38,643 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:51:38,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:51:38,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:51:38,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:51:38,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:51:38,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:51:38,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:51:38,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:51:38,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:51:38,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:51:38,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:51:38,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:51:38,649 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:51:38,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:51:38,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:51:38,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:51:38,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:51:38,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:51:38,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:51:38,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:51:38,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:38,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:51:38,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:51:38,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:51:38,652 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:51:38,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:51:38,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:51:38,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:51:38,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:51:38,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:51:38,655 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 -> 26889e4c825bc9df5f6bfdada4995dbeaf45a1d31e009b603ffadcd3ffbc80b6 [2024-11-10 06:51:38,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:51:38,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:51:39,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:51:39,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:51:39,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:51:39,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:40,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:51:40,724 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:51:40,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:40,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897501391/cb687f7c90c2439b9f2b2c9561805e7c/FLAGda8479790 [2024-11-10 06:51:40,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897501391/cb687f7c90c2439b9f2b2c9561805e7c [2024-11-10 06:51:40,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:51:40,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:51:40,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:40,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:51:40,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:51:40,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:40" (1/1) ... [2024-11-10 06:51:40,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed32058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:40, skipping insertion in model container [2024-11-10 06:51:40,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:40" (1/1) ... [2024-11-10 06:51:40,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:51:40,985 WARN L250 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-26.i[916,929] [2024-11-10 06:51:41,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:41,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:51:41,075 WARN L250 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-26.i[916,929] [2024-11-10 06:51:41,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:51:41,130 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:51:41,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41 WrapperNode [2024-11-10 06:51:41,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:51:41,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:41,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:51:41,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:51:41,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,186 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-10 06:51:41,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:51:41,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:51:41,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:51:41,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:51:41,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,225 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-11-10 06:51:41,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:51:41,253 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:51:41,253 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:51:41,253 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:51:41,254 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (1/1) ... [2024-11-10 06:51:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:51:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:51:41,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:51:41,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:51:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:51:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:51:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:51:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:51:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:51:41,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:51:41,435 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:51:41,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:51:45,186 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:51:45,187 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:51:45,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:51:45,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:51:45,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:45 BoogieIcfgContainer [2024-11-10 06:51:45,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:51:45,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:51:45,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:51:45,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:51:45,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:40" (1/3) ... [2024-11-10 06:51:45,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b067f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:45, skipping insertion in model container [2024-11-10 06:51:45,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:41" (2/3) ... [2024-11-10 06:51:45,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b067f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:45, skipping insertion in model container [2024-11-10 06:51:45,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:45" (3/3) ... [2024-11-10 06:51:45,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-26.i [2024-11-10 06:51:45,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:51:45,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:51:45,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:51:45,301 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;@1a0375c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:51:45,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:51:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 06:51:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 06:51:45,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:45,316 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 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-11-10 06:51:45,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 28832555, now seen corresponding path program 1 times [2024-11-10 06:51:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:45,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750117866] [2024-11-10 06:51:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:51:45,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:45,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:51:45,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:51:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:45,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:51:45,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:51:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-10 06:51:45,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:51:45,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:51:45,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750117866] [2024-11-10 06:51:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750117866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:51:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:51:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:51:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201888864] [2024-11-10 06:51:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:51:45,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:51:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:51:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:51:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:45,647 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 06:51:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:51:45,674 INFO L93 Difference]: Finished difference Result 78 states and 122 transitions. [2024-11-10 06:51:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:51:45,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-10 06:51:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:51:45,685 INFO L225 Difference]: With dead ends: 78 [2024-11-10 06:51:45,685 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 06:51:45,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:51:45,696 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:51:45,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:51:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 06:51:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 06:51:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 06:51:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-10 06:51:45,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 76 [2024-11-10 06:51:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:51:45,743 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-10 06:51:45,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 06:51:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-10 06:51:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 06:51:45,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:51:45,748 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 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-11-10 06:51:45,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:51:45,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:51:45,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:51:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:51:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1507188151, now seen corresponding path program 1 times [2024-11-10 06:51:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:51:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078836348] [2024-11-10 06:51:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:45,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:51:45,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:51:45,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:51:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:51:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:46,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:51:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:51:46,280 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-10 06:51:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1378548702] [2024-11-10 06:51:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:51:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:51:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:51:46,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:51:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 06:51:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:51:46,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 06:51:46,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:52:02,177 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 06:52:14,053 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:52:29,429 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 06:52:56,268 WARN L286 SmtUtils]: Spent 10.46s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)