./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.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-7.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 c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:41:32,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:41:32,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:41:32,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:41:32,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:41:32,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:41:32,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:41:32,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:41:32,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:41:32,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:41:32,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:41:32,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:41:32,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:41:32,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:41:32,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:41:32,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:41:32,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:41:32,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:41:32,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:41:32,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:41:32,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:41:32,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:41:32,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:41:32,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:41:32,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:41:32,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:41:32,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:41:32,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:41:32,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:41:32,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:41:32,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:41:32,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:41:32,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:41:32,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:41:32,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:41:32,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:41:32,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:41:32,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:41:32,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:41:32,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:41:32,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:41:32,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:41:32,559 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 -> c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 [2024-11-12 04:41:32,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:41:32,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:41:32,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:41:32,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:41:32,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:41:32,851 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-7.i [2024-11-12 04:41:34,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:41:34,529 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:41:34,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2024-11-12 04:41:34,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec08e113f/e1b81a5c11b1495aa1d43b7d9611a562/FLAG70ac29549 [2024-11-12 04:41:34,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec08e113f/e1b81a5c11b1495aa1d43b7d9611a562 [2024-11-12 04:41:34,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:41:34,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:41:34,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:41:34,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:41:34,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:41:34,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9cece2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34, skipping insertion in model container [2024-11-12 04:41:34,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:41:34,783 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-7.i[916,929] [2024-11-12 04:41:34,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:41:34,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:41:34,843 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-7.i[916,929] [2024-11-12 04:41:34,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:41:34,887 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:41:34,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34 WrapperNode [2024-11-12 04:41:34,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:41:34,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:41:34,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:41:34,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:41:34,896 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:41:34" (1/1) ... [2024-11-12 04:41:34,912 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:41:34" (1/1) ... [2024-11-12 04:41:34,943 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-12 04:41:34,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:41:34,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:41:34,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:41:34,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:41:34,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,973 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:41:34,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:34,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:41:34,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:41:34,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:41:34,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:41:34,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (1/1) ... [2024-11-12 04:41:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:41:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:41:35,037 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:41:35,045 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:41:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:41:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:41:35,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:41:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:41:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:41:35,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:41:35,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:41:35,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:41:35,488 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 04:41:35,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:41:35,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:41:35,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:41:35,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:35 BoogieIcfgContainer [2024-11-12 04:41:35,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:41:35,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:41:35,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:41:35,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:41:35,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:41:34" (1/3) ... [2024-11-12 04:41:35,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fadb346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:35, skipping insertion in model container [2024-11-12 04:41:35,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:34" (2/3) ... [2024-11-12 04:41:35,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fadb346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:35, skipping insertion in model container [2024-11-12 04:41:35,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:35" (3/3) ... [2024-11-12 04:41:35,513 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2024-11-12 04:41:35,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:41:35,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:41:35,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:41:35,600 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;@67e1172f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:41:35,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:41:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 04:41:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 04:41:35,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:35,617 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:35,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 533118968, now seen corresponding path program 1 times [2024-11-12 04:41:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:41:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768551264] [2024-11-12 04:41:35,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:41:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:41:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 04:41:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 04:41:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 04:41:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 04:41:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 04:41:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 04:41:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 04:41:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:41:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:41:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:41:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:41:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 04:41:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:41:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768551264] [2024-11-12 04:41:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768551264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:41:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:41:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:41:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949695004] [2024-11-12 04:41:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:41:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:41:35,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:41:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:41:35,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:41:35,970 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 04:41:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:41:36,001 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-11-12 04:41:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:41:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-12 04:41:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:41:36,015 INFO L225 Difference]: With dead ends: 83 [2024-11-12 04:41:36,016 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 04:41:36,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:41:36,026 INFO L435 NwaCegarLoop]: 58 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, 58 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:41:36,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:41:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 04:41:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 04:41:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 04:41:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-12 04:41:36,075 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2024-11-12 04:41:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:41:36,076 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-12 04:41:36,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 04:41:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-12 04:41:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 04:41:36,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:36,080 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:36,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:41:36,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:36,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1417074868, now seen corresponding path program 1 times [2024-11-12 04:41:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:41:36,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412110818] [2024-11-12 04:41:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:41:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:41:36,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248392489] [2024-11-12 04:41:36,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:41:36,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:41:36,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:41:36,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:41:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:41:36,435 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:41:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:41:36,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:41:36,539 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:41:36,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:41:36,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:41:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:41:36,749 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 04:41:36,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:41:36,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:41:36 BoogieIcfgContainer [2024-11-12 04:41:36,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:41:36,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:41:36,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:41:36,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:41:36,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:35" (3/4) ... [2024-11-12 04:41:36,837 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:41:36,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:41:36,839 INFO L158 Benchmark]: Toolchain (without parser) took 2285.22ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 88.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,840 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:41:36,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.94ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 94.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.55ms. Allocated memory is still 176.2MB. Free memory was 94.3MB in the beginning and 91.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,844 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,845 INFO L158 Benchmark]: RCFGBuilder took 515.11ms. Allocated memory is still 176.2MB. Free memory was 88.5MB in the beginning and 145.7MB in the end (delta: -57.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,846 INFO L158 Benchmark]: TraceAbstraction took 1324.52ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 89.3MB in the end (delta: 55.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-12 04:41:36,846 INFO L158 Benchmark]: Witness Printer took 6.12ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 88.4MB in the end (delta: 910.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:41:36,849 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.18ms. Allocated memory is still 121.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.94ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 94.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.55ms. Allocated memory is still 176.2MB. Free memory was 94.3MB in the beginning and 91.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 515.11ms. Allocated memory is still 176.2MB. Free memory was 88.5MB in the beginning and 145.7MB in the end (delta: -57.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1324.52ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 89.3MB in the end (delta: 55.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 6.12ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 88.4MB in the end (delta: 910.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_3 = 8.2; [L24] float var_1_4 = 1000000000.4; [L25] unsigned char var_1_6 = 4; [L26] double var_1_7 = 0.2; [L27] unsigned char var_1_8 = 0; [L28] unsigned short int var_1_9 = 32; [L29] unsigned char var_1_10 = 1; [L30] double var_1_11 = 127.5; [L31] unsigned long int var_1_12 = 5; [L32] double last_1_var_1_7 = 0.2; [L33] unsigned long int last_1_var_1_12 = 5; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L89] last_1_var_1_7 = var_1_7 [L90] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=5000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L71] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L77] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L77] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L78] var_1_9 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L80] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L81] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L86] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L101] RET updateVariables() [L102] CALL step() [L37] COND FALSE !(! (last_1_var_1_7 <= (var_1_3 - var_1_4))) [L44] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=2, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L46] COND FALSE !(var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) [L53] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=5, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L55] COND FALSE !(\read(var_1_8)) [L64] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((! (last_1_var_1_7 <= (var_1_3 - var_1_4))) ? ((-1 < last_1_var_1_12) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) ? ((var_1_8 && var_1_10) ? (var_1_7 == ((double) var_1_11)) : (var_1_7 == ((double) var_1_11))) : (var_1_7 == ((double) var_1_11)))) && (var_1_8 ? ((var_1_10 && (var_1_4 <= var_1_7)) ? ((((((var_1_4) > (var_1_11)) ? (var_1_4) : (var_1_11))) > var_1_7) ? (var_1_12 == ((unsigned long int) ((((((3725801564u - var_1_6) - var_1_1)) > (var_1_9)) ? (((3725801564u - var_1_6) - var_1_1)) : (var_1_9))))) : (var_1_12 == ((unsigned long int) var_1_6))) : 1) : (var_1_12 == ((unsigned long int) var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 12, 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, 58 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, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 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:41:36,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.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 c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:41:39,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:41:39,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:41:39,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:41:39,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:41:39,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:41:39,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:41:39,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:41:39,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:41:39,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:41:39,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:41:39,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:41:39,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:41:39,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:41:39,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:41:39,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:41:39,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:41:39,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:41:39,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:41:39,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:41:39,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:41:39,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:41:39,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:41:39,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:41:39,235 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:41:39,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:41:39,235 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:41:39,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:41:39,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:41:39,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:41:39,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:41:39,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:41:39,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:41:39,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:41:39,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:41:39,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:41:39,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:41:39,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:41:39,240 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:41:39,240 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:41:39,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:41:39,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:41:39,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:41:39,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:41:39,244 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 -> c89635c86a425cde697e700fe2c31fd3c6219e51225ce6611bf5868dd9f869f8 [2024-11-12 04:41:39,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:41:39,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:41:39,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:41:39,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:41:39,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:41:39,626 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-7.i [2024-11-12 04:41:41,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:41:41,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:41:41,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2024-11-12 04:41:41,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0763603f8/661e0720208c45b38a8a6769e92a1176/FLAG17011a8d7 [2024-11-12 04:41:41,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0763603f8/661e0720208c45b38a8a6769e92a1176 [2024-11-12 04:41:41,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:41:41,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:41:41,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:41:41,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:41:41,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:41:41,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:41" (1/1) ... [2024-11-12 04:41:41,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5222defd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:41, skipping insertion in model container [2024-11-12 04:41:41,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:41:41" (1/1) ... [2024-11-12 04:41:41,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:41:42,122 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-7.i[916,929] [2024-11-12 04:41:42,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:41:42,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:41:42,216 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-7.i[916,929] [2024-11-12 04:41:42,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:41:42,275 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:41:42,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42 WrapperNode [2024-11-12 04:41:42,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:41:42,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:41:42,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:41:42,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:41:42,284 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:41:42" (1/1) ... [2024-11-12 04:41:42,302 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:41:42" (1/1) ... [2024-11-12 04:41:42,334 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-12 04:41:42,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:41:42,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:41:42,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:41:42,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:41:42,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,379 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:41:42,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:41:42,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:41:42,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:41:42,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:41:42,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (1/1) ... [2024-11-12 04:41:42,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:41:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:41:42,449 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:41:42,452 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:41:42,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:41:42,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:41:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:41:42,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:41:42,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:41:42,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:41:42,566 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:41:42,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:41:44,081 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 04:41:44,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:41:44,095 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:41:44,096 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:41:44,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:44 BoogieIcfgContainer [2024-11-12 04:41:44,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:41:44,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:41:44,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:41:44,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:41:44,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:41:41" (1/3) ... [2024-11-12 04:41:44,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c81166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:44, skipping insertion in model container [2024-11-12 04:41:44,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:41:42" (2/3) ... [2024-11-12 04:41:44,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c81166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:41:44, skipping insertion in model container [2024-11-12 04:41:44,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:44" (3/3) ... [2024-11-12 04:41:44,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2024-11-12 04:41:44,122 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:41:44,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:41:44,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:41:44,207 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;@692ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:41:44,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:41:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 04:41:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 04:41:44,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:44,222 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:44,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash 533118968, now seen corresponding path program 1 times [2024-11-12 04:41:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:41:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517547695] [2024-11-12 04:41:44,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:44,245 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:41:44,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:41:44,250 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:41:44,252 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:41:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:44,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:41:44,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-12 04:41:44,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:41:44,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:41:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517547695] [2024-11-12 04:41:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517547695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:41:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:41:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:41:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789118859] [2024-11-12 04:41:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:41:44,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:41:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:41:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:41:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:41:44,625 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 04:41:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:41:44,646 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-11-12 04:41:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:41:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-12 04:41:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:41:44,655 INFO L225 Difference]: With dead ends: 83 [2024-11-12 04:41:44,656 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 04:41:44,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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:41:44,663 INFO L435 NwaCegarLoop]: 58 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, 58 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:41:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:41:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 04:41:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 04:41:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 04:41:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-12 04:41:44,700 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2024-11-12 04:41:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:41:44,700 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-12 04:41:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 04:41:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-12 04:41:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 04:41:44,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:44,704 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:41:44,905 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:41:44,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1417074868, now seen corresponding path program 1 times [2024-11-12 04:41:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:41:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584839610] [2024-11-12 04:41:44,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:44,908 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:41:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:41:44,910 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:41:44,911 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:41:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:45,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 04:41:45,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 04:41:51,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:41:51,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:41:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584839610] [2024-11-12 04:41:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584839610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:41:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:41:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:41:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510958516] [2024-11-12 04:41:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:41:51,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:41:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:41:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:41:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:41:51,411 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:41:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:41:53,914 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2024-11-12 04:41:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 04:41:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-11-12 04:41:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:41:53,917 INFO L225 Difference]: With dead ends: 110 [2024-11-12 04:41:53,917 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 04:41:53,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-12 04:41:53,919 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:41:53,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 173 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 04:41:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 04:41:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-11-12 04:41:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 04:41:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-11-12 04:41:53,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 79 [2024-11-12 04:41:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:41:53,940 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-11-12 04:41:53,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:41:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-11-12 04:41:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 04:41:53,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:53,943 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:53,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 04:41:54,144 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:41:54,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1809173135, now seen corresponding path program 1 times [2024-11-12 04:41:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:41:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675946805] [2024-11-12 04:41:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:54,147 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:41:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:41:54,152 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:41:54,154 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:41:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:54,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 04:41:54,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 04:41:54,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:41:54,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:41:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675946805] [2024-11-12 04:41:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675946805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:41:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:41:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:41:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761042213] [2024-11-12 04:41:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:41:54,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:41:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:41:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:41:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:41:54,367 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:41:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:41:54,550 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2024-11-12 04:41:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:41:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-12 04:41:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:41:54,555 INFO L225 Difference]: With dead ends: 132 [2024-11-12 04:41:54,556 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 04:41:54,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:41:54,558 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:41:54,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:41:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 04:41:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-12 04:41:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:41:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-11-12 04:41:54,573 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 80 [2024-11-12 04:41:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:41:54,573 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-11-12 04:41:54,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:41:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-11-12 04:41:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 04:41:54,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:41:54,575 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 04:41:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:41:54,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:41:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:41:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1866431437, now seen corresponding path program 1 times [2024-11-12 04:41:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:41:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416097265] [2024-11-12 04:41:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:41:54,778 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:41:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:41:54,781 INFO L229 MonitoredProcess]: Starting monitored process 5 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:41:54,782 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 (5)] Waiting until timeout for monitored process [2024-11-12 04:41:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:41:54,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 04:41:54,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:41:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 04:41:58,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:41:58,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:41:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416097265] [2024-11-12 04:41:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416097265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:41:58,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:41:58,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:41:58,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193173679] [2024-11-12 04:41:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:41:58,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:41:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:41:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:41:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:41:58,674 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:00,828 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-12 04:42:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 04:42:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-12 04:42:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:00,831 INFO L225 Difference]: With dead ends: 86 [2024-11-12 04:42:00,831 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 04:42:00,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-12 04:42:00,833 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:00,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 164 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 04:42:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 04:42:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-11-12 04:42:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:42:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-12 04:42:00,849 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 80 [2024-11-12 04:42:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:00,850 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-12 04:42:00,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-11-12 04:42:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 04:42:00,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:00,852 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 04:42:01,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:42:01,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -155695824, now seen corresponding path program 1 times [2024-11-12 04:42:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809287420] [2024-11-12 04:42:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:01,055 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:42:01,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:01,056 INFO L229 MonitoredProcess]: Starting monitored process 6 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:42:01,058 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 (6)] Waiting until timeout for monitored process [2024-11-12 04:42:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:01,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 04:42:01,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:42:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 04:42:05,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:42:05,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:42:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809287420] [2024-11-12 04:42:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809287420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:42:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182614191] [2024-11-12 04:42:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:42:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:42:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:42:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:42:05,853 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:13,539 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2024-11-12 04:42:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 04:42:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 04:42:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:13,542 INFO L225 Difference]: With dead ends: 113 [2024-11-12 04:42:13,542 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 04:42:13,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-12 04:42:13,543 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:13,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 224 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-12 04:42:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 04:42:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2024-11-12 04:42:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:42:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-11-12 04:42:13,558 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 81 [2024-11-12 04:42:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-11-12 04:42:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-11-12 04:42:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 04:42:13,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:13,562 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,575 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 04:42:13,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:42:13,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1619311538, now seen corresponding path program 1 times [2024-11-12 04:42:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857064572] [2024-11-12 04:42:13,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:13,764 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:42:13,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:13,766 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:13,767 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 (7)] Waiting until timeout for monitored process [2024-11-12 04:42:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:13,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 04:42:13,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:42:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 04:42:16,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:42:16,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:42:16,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857064572] [2024-11-12 04:42:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857064572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:16,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:16,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:42:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499660364] [2024-11-12 04:42:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:42:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:42:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:42:16,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:42:16,113 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:18,914 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2024-11-12 04:42:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 04:42:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 04:42:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:18,917 INFO L225 Difference]: With dead ends: 188 [2024-11-12 04:42:18,917 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 04:42:18,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-12 04:42:18,918 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:18,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 208 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 04:42:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 04:42:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2024-11-12 04:42:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 68 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:42:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-11-12 04:42:18,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 81 [2024-11-12 04:42:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-11-12 04:42:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-11-12 04:42:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 04:42:18,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:42:18,942 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,954 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 04:42:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:42:19,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:42:19,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:42:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -768087066, now seen corresponding path program 1 times [2024-11-12 04:42:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:42:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356483106] [2024-11-12 04:42:19,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:42:19,144 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:42:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:42:19,146 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:19,147 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 (8)] Waiting until timeout for monitored process [2024-11-12 04:42:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:42:19,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 04:42:19,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:42:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 04:42:27,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:42:27,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:42:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356483106] [2024-11-12 04:42:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356483106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:42:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:42:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:42:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877079601] [2024-11-12 04:42:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:42:27,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:42:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:42:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:42:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:42:27,856 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:42:45,529 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2024-11-12 04:42:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 04:42:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-12 04:42:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:42:45,533 INFO L225 Difference]: With dead ends: 193 [2024-11-12 04:42:45,533 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 04:42:45,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-12 04:42:45,535 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:42:45,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 251 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-12 04:42:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 04:42:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 04:42:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 04:42:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 04:42:45,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-11-12 04:42:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:42:45,537 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 04:42:45,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 04:42:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 04:42:45,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 04:42:45,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:42:45,554 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 04:42:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:42:45,744 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:42:45,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 04:42:52,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:42:52,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,087 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 04:42:52,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 04:42:52,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 04:42:52,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 04:42:52,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:42:52 BoogieIcfgContainer [2024-11-12 04:42:52,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:42:52,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:42:52,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:42:52,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:42:52,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:41:44" (3/4) ... [2024-11-12 04:42:52,103 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 04:42:52,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 04:42:52,113 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 04:42:52,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 04:42:52,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 04:42:52,114 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 04:42:52,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:42:52,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 04:42:52,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:42:52,225 INFO L158 Benchmark]: Toolchain (without parser) took 70353.40ms. Allocated memory was 73.4MB in the beginning and 354.4MB in the end (delta: 281.0MB). Free memory was 38.1MB in the beginning and 225.5MB in the end (delta: -187.4MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,225 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:42:52,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.18ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 41.0MB in the end (delta: -3.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.34ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 38.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,225 INFO L158 Benchmark]: Boogie Preprocessor took 67.92ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,226 INFO L158 Benchmark]: RCFGBuilder took 1687.66ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 46.3MB in the end (delta: -10.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,226 INFO L158 Benchmark]: TraceAbstraction took 68000.75ms. Allocated memory was 73.4MB in the beginning and 354.4MB in the end (delta: 281.0MB). Free memory was 45.6MB in the beginning and 231.8MB in the end (delta: -186.2MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,226 INFO L158 Benchmark]: Witness Printer took 124.30ms. Allocated memory is still 354.4MB. Free memory was 230.7MB in the beginning and 225.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:42:52,228 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.14ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.18ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 41.0MB in the end (delta: -3.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.34ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 38.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.92ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1687.66ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 46.3MB in the end (delta: -10.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 68000.75ms. Allocated memory was 73.4MB in the beginning and 354.4MB in the end (delta: 281.0MB). Free memory was 45.6MB in the beginning and 231.8MB in the end (delta: -186.2MB). Peak memory consumption was 208.7MB. Max. memory is 16.1GB. * Witness Printer took 124.30ms. Allocated memory is still 354.4MB. Free memory was 230.7MB in the beginning and 225.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 836 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 363 mSDtfsCounter, 1604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 50 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1848/1848 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 04:42:52,408 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 Writing output log to file Ultimate.log Result: TRUE