./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:24:20,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:24:20,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:24:20,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:24:20,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:24:20,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:24:20,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:24:20,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:24:20,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:24:20,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:24:20,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:24:20,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:24:20,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:24:20,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:24:20,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:24:20,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:24:20,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:24:20,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:24:20,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:24:20,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:24:20,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:24:20,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:24:20,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:24:20,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:24:20,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:24:20,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:24:20,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:24:20,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:24:20,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:24:20,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:24:20,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:24:20,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:24:20,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:24:20,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:24:20,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:24:20,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:24:20,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:24:20,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:24:20,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:24:20,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:24:20,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:24:20,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:24:20,966 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2024-10-13 03:24:21,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:24:21,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:24:21,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:24:21,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:24:21,268 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:24:21,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:22,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:24:22,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:24:22,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:22,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fe59cb4/a02c20ccbadb4164b46eae53a257a2c0/FLAG3f9807508 [2024-10-13 03:24:23,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fe59cb4/a02c20ccbadb4164b46eae53a257a2c0 [2024-10-13 03:24:23,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:24:23,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:24:23,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:24:23,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:24:23,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:24:23,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530566e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23, skipping insertion in model container [2024-10-13 03:24:23,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:24:23,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2024-10-13 03:24:23,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:24:23,589 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:24:23,602 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2024-10-13 03:24:23,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:24:23,646 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:24:23,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23 WrapperNode [2024-10-13 03:24:23,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:24:23,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:24:23,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:24:23,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:24:23,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,716 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-13 03:24:23,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:24:23,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:24:23,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:24:23,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:24:23,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,768 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:24:23,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:24:23,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:24:23,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:24:23,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:24:23,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (1/1) ... [2024-10-13 03:24:23,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:24:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:24:23,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:24:23,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:24:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:24:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:24:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:24:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:24:23,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:24:23,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:24:24,229 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:24:24,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:24:24,292 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:24:24,292 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:24:24,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:24:24 BoogieIcfgContainer [2024-10-13 03:24:24,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:24:24,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:24:24,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:24:24,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:24:24,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:24:23" (1/3) ... [2024-10-13 03:24:24,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d445000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:24:24, skipping insertion in model container [2024-10-13 03:24:24,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:23" (2/3) ... [2024-10-13 03:24:24,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d445000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:24:24, skipping insertion in model container [2024-10-13 03:24:24,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:24:24" (3/3) ... [2024-10-13 03:24:24,304 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:24,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:24:24,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:24:24,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:24:24,396 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;@63bb090c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:24:24,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:24:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 03:24:24,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:24,418 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:24,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1711721589, now seen corresponding path program 1 times [2024-10-13 03:24:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:24:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563783227] [2024-10-13 03:24:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:24:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:24:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:24:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:24:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:24:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:24:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:24:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:24:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:24:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:24:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:24:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:24:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:24:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:24:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:24:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:24:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:24:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:24:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:24:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 03:24:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:24:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563783227] [2024-10-13 03:24:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563783227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:24:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:24:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:24:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714250171] [2024-10-13 03:24:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:24:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:24:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:24:24,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:24:24,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:24:24,899 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:24:24,952 INFO L93 Difference]: Finished difference Result 97 states and 170 transitions. [2024-10-13 03:24:24,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:24:24,955 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-13 03:24:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:24:24,963 INFO L225 Difference]: With dead ends: 97 [2024-10-13 03:24:24,964 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 03:24:24,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:24:24,973 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:24:24,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:24:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 03:24:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 03:24:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-10-13 03:24:25,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 111 [2024-10-13 03:24:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:24:25,066 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-10-13 03:24:25,066 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-10-13 03:24:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 03:24:25,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:25,069 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:25,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:24:25,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash -418151943, now seen corresponding path program 1 times [2024-10-13 03:24:25,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:24:25,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359463373] [2024-10-13 03:24:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:24:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:24:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:24:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:24:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:24:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:24:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:24:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:24:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:24:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:24:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:24:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:24:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:24:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:24:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:24:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:24:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:24:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:24:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 03:24:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 03:24:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:24:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359463373] [2024-10-13 03:24:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359463373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:24:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977719726] [2024-10-13 03:24:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:24:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:24:26,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:24:26,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:24:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:26,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 03:24:26,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:24:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 03:24:26,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:24:26,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977719726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:24:26,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:24:26,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-10-13 03:24:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227801321] [2024-10-13 03:24:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:24:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:24:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:24:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:24:26,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:24:26,448 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:24:26,913 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2024-10-13 03:24:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 03:24:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-13 03:24:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:24:26,920 INFO L225 Difference]: With dead ends: 105 [2024-10-13 03:24:26,921 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 03:24:26,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-13 03:24:26,925 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 101 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:24:26,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 124 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:24:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 03:24:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-13 03:24:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-13 03:24:26,948 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 111 [2024-10-13 03:24:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:24:26,949 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-13 03:24:26,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-13 03:24:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:24:26,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:26,951 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:26,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:24:27,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:24:27,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:27,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1371630986, now seen corresponding path program 1 times [2024-10-13 03:24:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:24:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978600611] [2024-10-13 03:24:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:24:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:24:27,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:24:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:24:27,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:24:27,362 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:24:27,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:24:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:24:27,368 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 03:24:27,426 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:24:27,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:24:27 BoogieIcfgContainer [2024-10-13 03:24:27,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:24:27,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:24:27,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:24:27,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:24:27,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:24:24" (3/4) ... [2024-10-13 03:24:27,434 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:24:27,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:24:27,436 INFO L158 Benchmark]: Toolchain (without parser) took 4092.47ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 127.0MB in the beginning and 185.5MB in the end (delta: -58.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-13 03:24:27,436 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:24:27,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.75ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 112.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:24:27,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.63ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:24:27,440 INFO L158 Benchmark]: Boogie Preprocessor took 81.33ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 107.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:24:27,440 INFO L158 Benchmark]: RCFGBuilder took 492.71ms. Allocated memory is still 184.5MB. Free memory was 107.3MB in the beginning and 88.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:24:27,441 INFO L158 Benchmark]: TraceAbstraction took 3132.30ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 87.6MB in the beginning and 185.5MB in the end (delta: -97.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:24:27,441 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 266.3MB. Free memory is still 185.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:24:27,442 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 184.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.75ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 112.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.63ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.33ms. Allocated memory is still 184.5MB. Free memory was 110.3MB in the beginning and 107.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.71ms. Allocated memory is still 184.5MB. Free memory was 107.3MB in the beginning and 88.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3132.30ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 87.6MB in the beginning and 185.5MB in the end (delta: -97.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 266.3MB. Free memory is still 185.5MB. 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 someBinaryFLOATComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] float var_1_8 = 128.9; [L30] float var_1_9 = 63.363; [L31] float var_1_10 = 4.575; [L32] float var_1_11 = 25.5; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_8=1289/10, var_1_9=63363/1000] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_8=1289/10, var_1_9=63363/1000] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10, var_1_9=63363/1000] [L89] var_1_9 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L90] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L91] var_1_10 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L92] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L93] var_1_13 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L97] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L98] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=65535, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=65535, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L50] COND FALSE !(stepLocal_0 <= var_1_4) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=256, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1289/10] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=13835058056355905540, var_1_11=13835058056355905540, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((float) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((float) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((float) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=13835058056355905540, var_1_11=13835058056355905540, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] [L19] reach_error() VAL [isInitial=1, var_1_10=13835058056355905540, var_1_11=13835058056355905540, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65535, var_1_4=131070, var_1_5=-4294967296, var_1_6=13835058056355905535U, var_1_7=-3221225473, var_1_8=1/2, var_1_9=1/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 113 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 1 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1833/1836 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:24:27,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:24:29,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:24:29,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:24:29,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:24:29,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:24:29,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:24:29,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:24:29,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:24:29,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:24:29,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:24:29,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:24:29,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:24:29,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:24:29,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:24:29,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:24:29,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:24:29,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:24:29,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:24:29,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:24:29,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:24:29,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:24:29,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:24:29,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:24:29,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:24:29,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:24:29,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:24:29,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:24:29,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:24:29,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:24:29,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:24:29,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:24:29,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:24:29,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:24:29,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:24:29,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:24:29,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:24:29,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:24:29,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:24:29,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:24:29,974 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:24:29,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:24:29,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:24:29,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:24:29,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:24:29,976 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:24:29,976 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2024-10-13 03:24:30,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:24:30,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:24:30,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:24:30,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:24:30,376 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:24:30,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:31,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:24:32,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:24:32,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:32,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928e593af/bd37e63c5ae9440984915485025847c0/FLAGc0e9d74b6 [2024-10-13 03:24:32,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928e593af/bd37e63c5ae9440984915485025847c0 [2024-10-13 03:24:32,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:24:32,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:24:32,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:24:32,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:24:32,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:24:32,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:32,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614d8710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32, skipping insertion in model container [2024-10-13 03:24:32,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:32,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:24:32,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2024-10-13 03:24:32,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:24:32,886 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:24:32,898 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2024-10-13 03:24:32,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:24:32,948 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:24:32,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32 WrapperNode [2024-10-13 03:24:32,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:24:32,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:24:32,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:24:32,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:24:32,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:32,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:32,994 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-13 03:24:32,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:24:32,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:24:32,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:24:32,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:24:33,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,035 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:24:33,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:24:33,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:24:33,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:24:33,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:24:33,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (1/1) ... [2024-10-13 03:24:33,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:24:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:24:33,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:24:33,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:24:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:24:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:24:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:24:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:24:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:24:33,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:24:33,265 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:24:33,267 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:24:33,617 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:24:33,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:24:33,679 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:24:33,679 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:24:33,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:24:33 BoogieIcfgContainer [2024-10-13 03:24:33,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:24:33,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:24:33,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:24:33,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:24:33,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:24:32" (1/3) ... [2024-10-13 03:24:33,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d3e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:24:33, skipping insertion in model container [2024-10-13 03:24:33,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:24:32" (2/3) ... [2024-10-13 03:24:33,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d3e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:24:33, skipping insertion in model container [2024-10-13 03:24:33,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:24:33" (3/3) ... [2024-10-13 03:24:33,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2024-10-13 03:24:33,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:24:33,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:24:33,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:24:33,802 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;@c8967bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:24:33,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:24:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 03:24:33,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:33,820 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:33,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1711721589, now seen corresponding path program 1 times [2024-10-13 03:24:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:24:33,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501443094] [2024-10-13 03:24:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:24:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:24:33,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:24:33,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:24:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:34,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:24:34,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:24:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 03:24:34,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:24:34,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:24:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501443094] [2024-10-13 03:24:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501443094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:24:34,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:24:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:24:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280332675] [2024-10-13 03:24:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:24:34,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:24:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:24:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:24:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:24:34,175 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:24:34,237 INFO L93 Difference]: Finished difference Result 97 states and 170 transitions. [2024-10-13 03:24:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:24:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-13 03:24:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:24:34,250 INFO L225 Difference]: With dead ends: 97 [2024-10-13 03:24:34,251 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 03:24:34,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:24:34,262 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:24:34,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:24:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 03:24:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 03:24:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-10-13 03:24:34,316 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 111 [2024-10-13 03:24:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:24:34,317 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-10-13 03:24:34,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-10-13 03:24:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 03:24:34,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:34,321 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:34,332 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-10-13 03:24:34,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:24:34,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -418151943, now seen corresponding path program 1 times [2024-10-13 03:24:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:24:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027166755] [2024-10-13 03:24:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:34,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:24:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:24:34,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:24:34,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:24:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:34,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 03:24:34,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:24:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 03:24:35,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:24:35,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:24:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027166755] [2024-10-13 03:24:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027166755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:24:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:24:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:24:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863447033] [2024-10-13 03:24:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:24:35,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:24:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:24:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:24:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:24:35,051 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:24:35,588 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2024-10-13 03:24:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 03:24:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-13 03:24:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:24:35,595 INFO L225 Difference]: With dead ends: 105 [2024-10-13 03:24:35,595 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 03:24:35,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-10-13 03:24:35,598 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 100 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:24:35,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 123 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:24:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 03:24:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-13 03:24:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:24:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-13 03:24:35,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 111 [2024-10-13 03:24:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:24:35,630 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-13 03:24:35,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:24:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-13 03:24:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 03:24:35,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:24:35,632 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:24:35,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:24:35,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:24:35,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:24:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:24:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1371630986, now seen corresponding path program 1 times [2024-10-13 03:24:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:24:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636964241] [2024-10-13 03:24:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:24:35,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:24:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:24:35,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:24:35,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:24:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:24:36,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 03:24:36,028 INFO L278 TraceCheckSpWp]: Computing forward predicates...