./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.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 9e92930e750196482f17f07849312ddc82a1b9515fee56924e2c0ca266f21be0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:39:04,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:39:04,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:39:04,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:39:04,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:39:04,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:39:04,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:39:04,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:39:04,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:39:04,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:39:04,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:39:04,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:39:04,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:39:04,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:39:04,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:39:04,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:39:04,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:39:04,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:39:04,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:39:04,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:39:04,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:39:04,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:39:04,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:39:04,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:39:04,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:39:04,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:39:04,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:39:04,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:39:04,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:39:04,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:39:04,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:39:04,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:39:04,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:04,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:39:04,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:39:04,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:39:04,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:39:04,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:39:04,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:39:04,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:39:04,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:39:04,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:39:04,751 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 -> 9e92930e750196482f17f07849312ddc82a1b9515fee56924e2c0ca266f21be0 [2024-11-12 04:39:05,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:39:05,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:39:05,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:39:05,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:39:05,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:39:05,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:06,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:39:06,786 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:39:06,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:06,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa50481c4/daa9368d0e0d4563befb949155604b60/FLAG41837bbee [2024-11-12 04:39:06,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa50481c4/daa9368d0e0d4563befb949155604b60 [2024-11-12 04:39:06,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:39:06,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:39:06,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:06,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:39:06,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:39:06,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:06" (1/1) ... [2024-11-12 04:39:06,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9560647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:06, skipping insertion in model container [2024-11-12 04:39:06,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:06" (1/1) ... [2024-11-12 04:39:06,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:39:07,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i[917,930] [2024-11-12 04:39:07,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:07,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:39:07,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i[917,930] [2024-11-12 04:39:07,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:07,168 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:39:07,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07 WrapperNode [2024-11-12 04:39:07,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:07,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:07,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:39:07,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:39:07,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,212 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-12 04:39:07,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:07,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:39:07,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:39:07,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:39:07,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,258 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:39:07,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:39:07,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:39:07,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:39:07,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:39:07,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (1/1) ... [2024-11-12 04:39:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:39:07,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:39:07,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:39:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:39:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:39:07,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:39:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:39:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:39:07,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:39:07,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:39:07,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:39:07,768 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:39:07,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:39:07,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:39:07,782 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:39:07,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:07 BoogieIcfgContainer [2024-11-12 04:39:07,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:39:07,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:39:07,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:39:07,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:39:07,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:39:06" (1/3) ... [2024-11-12 04:39:07,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c223db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:07, skipping insertion in model container [2024-11-12 04:39:07,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:07" (2/3) ... [2024-11-12 04:39:07,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c223db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:07, skipping insertion in model container [2024-11-12 04:39:07,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:07" (3/3) ... [2024-11-12 04:39:07,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:07,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:39:07,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:39:07,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:39:07,885 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;@64f3daf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:39:07,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:39:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 04:39:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 04:39:07,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:07,901 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:07,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:07,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-12 04:39:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:39:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842090099] [2024-11-12 04:39:07,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:39:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:39:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:39:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:39:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 04:39:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:39:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 04:39:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:39:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 04:39:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:39:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 04:39:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:39:08,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842090099] [2024-11-12 04:39:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842090099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:39:08,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:39:08,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:39:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883118048] [2024-11-12 04:39:08,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:39:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:39:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:39:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:39:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:08,274 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 04:39:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:39:08,293 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-12 04:39:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:39:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-12 04:39:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:39:08,301 INFO L225 Difference]: With dead ends: 77 [2024-11-12 04:39:08,301 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 04:39:08,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:08,307 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:39:08,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:39:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 04:39:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 04:39:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 04:39:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-12 04:39:08,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-12 04:39:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:39:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-12 04:39:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 04:39:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-12 04:39:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 04:39:08,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:08,349 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:39:08,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-12 04:39:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:39:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285393872] [2024-11-12 04:39:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:39:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:39:08,474 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:39:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:39:08,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:39:08,593 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:39:08,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:39:08,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:39:08,602 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 04:39:08,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:39:08,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:39:08 BoogieIcfgContainer [2024-11-12 04:39:08,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:39:08,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:39:08,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:39:08,680 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:39:08,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:07" (3/4) ... [2024-11-12 04:39:08,683 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:39:08,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:39:08,686 INFO L158 Benchmark]: Toolchain (without parser) took 1854.33ms. Allocated memory is still 180.4MB. Free memory was 139.0MB in the beginning and 94.4MB in the end (delta: 44.6MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,687 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:39:08,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.63ms. Allocated memory is still 180.4MB. Free memory was 139.0MB in the beginning and 125.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.14ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,690 INFO L158 Benchmark]: Boogie Preprocessor took 77.06ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 121.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,690 INFO L158 Benchmark]: RCFGBuilder took 490.30ms. Allocated memory is still 180.4MB. Free memory was 121.3MB in the beginning and 139.5MB in the end (delta: -18.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,691 INFO L158 Benchmark]: TraceAbstraction took 893.32ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 94.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-12 04:39:08,692 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 180.4MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:39:08,694 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.16ms. Allocated memory is still 100.7MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.63ms. Allocated memory is still 180.4MB. Free memory was 139.0MB in the beginning and 125.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.14ms. Allocated memory is still 180.4MB. Free memory was 125.4MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.06ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 121.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.30ms. Allocated memory is still 180.4MB. Free memory was 121.3MB in the beginning and 139.5MB in the end (delta: -18.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 893.32ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 94.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 180.4MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 3.5; [L24] signed char var_1_9 = 16; [L25] signed char var_1_10 = 16; [L26] signed char var_1_11 = 4; [L27] signed long int var_1_12 = 8; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 1; [L30] double var_1_15 = 3.8; [L31] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_8 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L63] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L64] var_1_10 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L65] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L67] var_1_11 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L68] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L70] var_1_13 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L71] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L73] var_1_14 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L89] RET updateVariables() [L90] CALL step() [L35] COND FALSE !(-4 > last_1_var_1_12) [L40] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L42] unsigned char stepLocal_0 = ! var_1_13; VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L43] COND FALSE !(stepLocal_0 || var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L50] var_1_15 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L51] COND FALSE !(var_1_15 <= var_1_15) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L56] COND TRUE var_1_12 > var_1_9 [L57] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_15 <= var_1_15) ? (((var_1_12 + var_1_12) >= (var_1_12 + var_1_9)) ? (var_1_1 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1) : ((var_1_12 > var_1_9) ? (var_1_1 == ((double) var_1_8)) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? (var_1_9 == ((signed char) ((((var_1_10 + var_1_11) < 0 ) ? -(var_1_10 + var_1_11) : (var_1_10 + var_1_11))))) : 1) : (var_1_9 == ((signed char) var_1_10)))) && (((! var_1_13) || var_1_14) ? ((! var_1_14) ? (var_1_12 == ((signed long int) (((((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) : ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))))) : (var_1_12 == ((signed long int) var_1_9))) : 1)) && (var_1_15 == ((double) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:39:08,726 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.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 9e92930e750196482f17f07849312ddc82a1b9515fee56924e2c0ca266f21be0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:39:11,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:39:11,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:39:11,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:39:11,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:39:11,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:39:11,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:39:11,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:39:11,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:39:11,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:39:11,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:39:11,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:39:11,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:39:11,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:39:11,146 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:39:11,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:39:11,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:39:11,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:39:11,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:39:11,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:39:11,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:39:11,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:39:11,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:39:11,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:39:11,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:39:11,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:39:11,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:39:11,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:39:11,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:39:11,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:39:11,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:39:11,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:39:11,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:39:11,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:39:11,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:11,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:39:11,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:39:11,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:39:11,154 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:39:11,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:39:11,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:39:11,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:39:11,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:39:11,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:39:11,155 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 -> 9e92930e750196482f17f07849312ddc82a1b9515fee56924e2c0ca266f21be0 [2024-11-12 04:39:11,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:39:11,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:39:11,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:39:11,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:39:11,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:39:11,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:13,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:39:13,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:39:13,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:13,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f38fdcc0/c2ba5ebccf184521b5dd3a8baec9ecb9/FLAGff8fb8544 [2024-11-12 04:39:13,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f38fdcc0/c2ba5ebccf184521b5dd3a8baec9ecb9 [2024-11-12 04:39:13,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:39:13,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:39:13,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:13,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:39:13,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:39:13,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:13" (1/1) ... [2024-11-12 04:39:13,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4393806a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:13, skipping insertion in model container [2024-11-12 04:39:13,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:13" (1/1) ... [2024-11-12 04:39:13,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:39:14,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i[917,930] [2024-11-12 04:39:14,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:14,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:39:14,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-47.i[917,930] [2024-11-12 04:39:14,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:14,161 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:39:14,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14 WrapperNode [2024-11-12 04:39:14,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:14,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:14,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:39:14,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:39:14,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,228 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-12 04:39:14,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:14,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:39:14,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:39:14,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:39:14,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:39:14,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:39:14,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:39:14,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:39:14,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:39:14,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (1/1) ... [2024-11-12 04:39:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:39:14,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:39:14,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:39:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:39:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:39:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:39:14,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:39:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:39:14,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:39:14,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:39:14,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:39:14,758 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:39:14,758 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:39:14,775 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:39:14,777 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:39:14,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:14 BoogieIcfgContainer [2024-11-12 04:39:14,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:39:14,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:39:14,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:39:14,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:39:14,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:39:13" (1/3) ... [2024-11-12 04:39:14,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18416b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:14, skipping insertion in model container [2024-11-12 04:39:14,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:14" (2/3) ... [2024-11-12 04:39:14,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18416b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:14, skipping insertion in model container [2024-11-12 04:39:14,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:14" (3/3) ... [2024-11-12 04:39:14,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-47.i [2024-11-12 04:39:14,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:39:14,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:39:14,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:39:14,891 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;@15cb3a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:39:14,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:39:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 04:39:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 04:39:14,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:14,907 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:14,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:14,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-12 04:39:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:39:14,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380533312] [2024-11-12 04:39:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:39:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:39:14,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:39:14,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:39:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:15,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:39:15,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:39:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 04:39:15,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:39:15,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:39:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380533312] [2024-11-12 04:39:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380533312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:39:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:39:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:39:15,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471958234] [2024-11-12 04:39:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:39:15,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:39:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:39:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:39:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:15,209 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 04:39:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:39:15,239 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-12 04:39:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:39:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-12 04:39:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:39:15,250 INFO L225 Difference]: With dead ends: 77 [2024-11-12 04:39:15,251 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 04:39:15,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:15,261 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:39:15,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:39:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 04:39:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 04:39:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 04:39:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-12 04:39:15,313 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-12 04:39:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:39:15,315 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-12 04:39:15,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 04:39:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-12 04:39:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 04:39:15,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:15,318 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:15,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:39:15,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-11-12 04:39:15,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:15,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-12 04:39:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:39:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408056674] [2024-11-12 04:39:15,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:39:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:39:15,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:39:15,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:39:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:39:15,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:39:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 04:39:16,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:39:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 04:39:17,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:39:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408056674] [2024-11-12 04:39:17,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408056674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:39:17,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:39:17,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-12 04:39:17,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007035928] [2024-11-12 04:39:17,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:39:17,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:39:17,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:39:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:39:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:39:17,344 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-12 04:39:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:39:17,996 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2024-11-12 04:39:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:39:17,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65 [2024-11-12 04:39:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:39:18,001 INFO L225 Difference]: With dead ends: 78 [2024-11-12 04:39:18,001 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 04:39:18,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:39:18,005 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:39:18,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 92 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:39:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 04:39:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-12 04:39:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 04:39:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-12 04:39:18,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 65 [2024-11-12 04:39:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:39:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-12 04:39:18,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-12 04:39:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-12 04:39:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 04:39:18,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:18,028 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:18,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:39:18,228 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-11-12 04:39:18,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -316154374, now seen corresponding path program 1 times [2024-11-12 04:39:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:39:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385838726] [2024-11-12 04:39:18,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:39:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:39:18,235 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-11-12 04:39:18,237 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-11-12 04:39:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:18,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 04:39:18,324 INFO L279 TraceCheckSpWp]: Computing forward predicates...