./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-8.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 d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:03:36,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:03:36,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:03:36,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:03:36,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:03:36,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:03:36,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:03:36,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:03:36,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:03:36,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:03:36,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:03:36,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:03:36,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:03:36,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:03:36,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:03:36,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:03:36,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:03:36,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:03:36,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:03:36,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:03:36,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:03:36,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:03:36,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:03:36,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:03:36,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:03:36,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:03:36,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:03:36,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:03:36,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:03:36,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:03:36,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:03:36,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:03:36,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:36,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:03:36,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:03:36,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:03:36,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:03:36,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:03:36,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:03:36,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:03:36,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:03:36,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:03:36,875 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 -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2024-11-08 23:03:37,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:03:37,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:03:37,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:03:37,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:03:37,096 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:03:37,097 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-8.i [2024-11-08 23:03:38,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:03:38,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:03:38,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2024-11-08 23:03:38,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d2fcb9e/f9bfc8ba331946c2955e45d50fe537e1/FLAGa5a77a478 [2024-11-08 23:03:39,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d2fcb9e/f9bfc8ba331946c2955e45d50fe537e1 [2024-11-08 23:03:39,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:03:39,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:03:39,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:39,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:03:39,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:03:39,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77802840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39, skipping insertion in model container [2024-11-08 23:03:39,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:03:39,503 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-8.i[916,929] [2024-11-08 23:03:39,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:39,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:03:39,547 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-8.i[916,929] [2024-11-08 23:03:39,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:39,580 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:03:39,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39 WrapperNode [2024-11-08 23:03:39,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:39,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:39,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:03:39,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:03:39,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,615 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-08 23:03:39,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:39,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:03:39,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:03:39,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:03:39,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,637 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-08 23:03:39,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:03:39,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:03:39,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:03:39,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:03:39,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (1/1) ... [2024-11-08 23:03:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:03:39,709 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-08 23:03:39,711 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-08 23:03:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:03:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:03:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:03:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:03:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:03:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:03:39,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:03:39,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:03:40,001 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:03:40,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:03:40,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:03:40,014 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:03:40,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:40 BoogieIcfgContainer [2024-11-08 23:03:40,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:03:40,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:03:40,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:03:40,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:03:40,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:03:39" (1/3) ... [2024-11-08 23:03:40,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc0126a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:40, skipping insertion in model container [2024-11-08 23:03:40,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:39" (2/3) ... [2024-11-08 23:03:40,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc0126a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:40, skipping insertion in model container [2024-11-08 23:03:40,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:40" (3/3) ... [2024-11-08 23:03:40,023 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2024-11-08 23:03:40,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:03:40,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:03:40,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:03:40,080 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;@2dcb777e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:03:40,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:03:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:40,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:40,093 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:40,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:40,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1230558902, now seen corresponding path program 1 times [2024-11-08 23:03:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799257223] [2024-11-08 23:03:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:03:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:03:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:03:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:03:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:03:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:03:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:03:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:03:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:03:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:03:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:03:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:03:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:03:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:03:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 23:03:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:03:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799257223] [2024-11-08 23:03:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799257223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:03:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691593717] [2024-11-08 23:03:40,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:40,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:03:40,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:03:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:03:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:03:40,397 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 23:03:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:40,414 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2024-11-08 23:03:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:03:40,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-08 23:03:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:40,421 INFO L225 Difference]: With dead ends: 87 [2024-11-08 23:03:40,421 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 23:03:40,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-08 23:03:40,427 INFO L432 NwaCegarLoop]: 60 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, 60 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-08 23:03:40,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:03:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 23:03:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 23:03:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-08 23:03:40,460 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2024-11-08 23:03:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-08 23:03:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 23:03:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-08 23:03:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:40,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:40,463 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:40,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:03:40,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:40,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1070173934, now seen corresponding path program 1 times [2024-11-08 23:03:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015628110] [2024-11-08 23:03:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:03:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:03:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:03:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:03:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:03:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:03:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:03:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:03:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:03:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:03:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:03:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:03:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:03:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:03:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 23:03:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:03:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015628110] [2024-11-08 23:03:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015628110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:03:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648260652] [2024-11-08 23:03:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:03:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:03:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:03:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:03:40,710 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:03:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:40,838 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2024-11-08 23:03:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:03:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-08 23:03:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:40,841 INFO L225 Difference]: With dead ends: 83 [2024-11-08 23:03:40,841 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 23:03:40,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:03:40,843 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:03:40,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 76 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:03:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 23:03:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 23:03:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-08 23:03:40,857 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 92 [2024-11-08 23:03:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:40,858 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-08 23:03:40,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:03:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-08 23:03:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:40,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:40,861 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:40,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:03:40,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1012915632, now seen corresponding path program 1 times [2024-11-08 23:03:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:03:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077611249] [2024-11-08 23:03:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:03:40,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:03:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:03:41,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:03:41,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:03:41,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:03:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:03:41,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:03:41,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:03:41,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:03:41 BoogieIcfgContainer [2024-11-08 23:03:41,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:03:41,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:03:41,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:03:41,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:03:41,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:40" (3/4) ... [2024-11-08 23:03:41,151 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:03:41,152 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:03:41,153 INFO L158 Benchmark]: Toolchain (without parser) took 1959.47ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 97.2MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:03:41,153 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:03:41,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.80ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 126.5MB in the end (delta: -34.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:03:41,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.07ms. Allocated memory is still 161.5MB. Free memory was 126.5MB in the beginning and 123.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:03:41,156 INFO L158 Benchmark]: Boogie Preprocessor took 42.82ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 120.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:03:41,156 INFO L158 Benchmark]: RCFGBuilder took 355.12ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 105.5MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:03:41,157 INFO L158 Benchmark]: TraceAbstraction took 1131.53ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 97.2MB in the end (delta: 7.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-08 23:03:41,157 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 161.5MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:03:41,160 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 98.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.80ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 126.5MB in the end (delta: -34.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.07ms. Allocated memory is still 161.5MB. Free memory was 126.5MB in the beginning and 123.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.82ms. Allocated memory is still 161.5MB. Free memory was 123.8MB in the beginning and 120.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 355.12ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 105.5MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1131.53ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 97.2MB in the end (delta: 7.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 161.5MB. Free memory is still 97.2MB. 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 94, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] float var_1_12 = 2.4; [L29] float var_1_13 = 127.75; [L30] float var_1_14 = 0.0; [L31] float var_1_15 = 31.4; [L32] float var_1_16 = 256.75; [L33] float var_1_17 = 256.6; [L34] signed long int var_1_18 = 0; [L35] unsigned char var_1_19 = 32; [L36] unsigned char var_1_20 = 100; VAL [isInitial=0, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L75] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_13 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_14 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_15 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] var_1_16 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] var_1_20 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L102] RET updateVariables() [L103] CALL step() [L40] var_1_17 = var_1_14 [L41] var_1_19 = var_1_20 [L42] var_1_18 = var_1_19 [L43] unsigned char stepLocal_1 = var_1_19; [L44] signed long int stepLocal_0 = (var_1_18 * var_1_18) * (var_1_19 - var_1_19); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] COND FALSE !(stepLocal_0 >= 1u) [L52] var_1_8 = var_1_19 VAL [isInitial=1, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L54] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L55] COND FALSE !(var_1_19 > stepLocal_2) [L58] var_1_12 = (var_1_16 - (var_1_14 + var_1_15)) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L60] COND TRUE var_1_18 >= (8u * var_1_8) [L61] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return ((((((var_1_18 >= (8u * var_1_8)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && ((((var_1_18 * var_1_18) * (var_1_19 - var_1_19)) >= 1u) ? ((var_1_18 <= var_1_19) ? (var_1_8 == ((signed long int) var_1_19)) : (var_1_8 == ((signed long int) var_1_19))) : (var_1_8 == ((signed long int) var_1_19)))) && ((var_1_19 > var_1_8) ? (var_1_12 == ((float) (var_1_13 + ((var_1_14 - var_1_15) - var_1_16)))) : (var_1_12 == ((float) (var_1_16 - (var_1_14 + var_1_15)))))) && (var_1_17 == ((float) var_1_14))) && (var_1_18 == ((signed long int) var_1_19))) && (var_1_19 == ((unsigned char) var_1_20)) ; VAL [\result=0, isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 114 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 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-08 23:03:41,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.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 d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:03:43,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:03:43,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:03:43,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:03:43,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:03:43,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:03:43,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:03:43,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:03:43,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:03:43,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:03:43,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:03:43,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:03:43,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:03:43,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:03:43,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:03:43,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:03:43,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:03:43,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:03:43,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:03:43,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:03:43,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:03:43,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:03:43,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:03:43,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:03:43,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:03:43,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:03:43,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:03:43,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:03:43,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:03:43,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:03:43,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:03:43,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:03:43,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:03:43,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:03:43,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:43,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:03:43,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:03:43,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:03:43,298 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:03:43,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:03:43,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:03:43,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:03:43,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:03:43,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:03:43,300 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 -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2024-11-08 23:03:43,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:03:43,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:03:43,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:03:43,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:03:43,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:03:43,580 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-8.i [2024-11-08 23:03:44,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:03:45,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:03:45,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2024-11-08 23:03:45,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251edc33a/3c1349e0925a4231baa56bca7c7d7803/FLAG5439f0e80 [2024-11-08 23:03:45,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251edc33a/3c1349e0925a4231baa56bca7c7d7803 [2024-11-08 23:03:45,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:03:45,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:03:45,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:45,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:03:45,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:03:45,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11012644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45, skipping insertion in model container [2024-11-08 23:03:45,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:03:45,675 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-8.i[916,929] [2024-11-08 23:03:45,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:45,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:03:45,741 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-8.i[916,929] [2024-11-08 23:03:45,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:03:45,798 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:03:45,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45 WrapperNode [2024-11-08 23:03:45,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:03:45,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:45,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:03:45,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:03:45,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,839 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-08 23:03:45,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:03:45,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:03:45,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:03:45,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:03:45,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,863 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-08 23:03:45,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:03:45,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:03:45,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:03:45,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:03:45,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (1/1) ... [2024-11-08 23:03:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:03:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:03:45,925 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-08 23:03:45,939 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-08 23:03:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:03:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:03:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:03:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:03:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:03:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:03:46,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:03:46,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:03:47,997 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:03:47,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:03:48,011 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:03:48,011 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:03:48,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:48 BoogieIcfgContainer [2024-11-08 23:03:48,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:03:48,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:03:48,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:03:48,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:03:48,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:03:45" (1/3) ... [2024-11-08 23:03:48,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313703af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:48, skipping insertion in model container [2024-11-08 23:03:48,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:03:45" (2/3) ... [2024-11-08 23:03:48,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313703af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:03:48, skipping insertion in model container [2024-11-08 23:03:48,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:03:48" (3/3) ... [2024-11-08 23:03:48,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2024-11-08 23:03:48,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:03:48,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:03:48,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:03:48,092 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;@70d0914a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:03:48,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:03:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:48,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:48,106 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:48,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1230558902, now seen corresponding path program 1 times [2024-11-08 23:03:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:03:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190211412] [2024-11-08 23:03:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:48,126 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-08 23:03:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:03:48,130 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-08 23:03:48,131 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-08 23:03:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:48,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:03:48,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:03:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 23:03:48,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:03:48,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:03:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190211412] [2024-11-08 23:03:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190211412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:03:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726084360] [2024-11-08 23:03:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:03:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:03:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:03:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:03:48,579 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 23:03:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:48,620 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2024-11-08 23:03:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:03:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-08 23:03:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:48,631 INFO L225 Difference]: With dead ends: 87 [2024-11-08 23:03:48,631 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 23:03:48,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-08 23:03:48,639 INFO L432 NwaCegarLoop]: 60 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, 60 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-08 23:03:48,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:03:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 23:03:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 23:03:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-08 23:03:48,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 92 [2024-11-08 23:03:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:48,691 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-08 23:03:48,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 23:03:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-08 23:03:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:48,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:48,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:48,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:03:48,896 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-08 23:03:48,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:48,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1070173934, now seen corresponding path program 1 times [2024-11-08 23:03:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:03:48,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212608199] [2024-11-08 23:03:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:48,901 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-08 23:03:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:03:48,903 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-08 23:03:48,905 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-08 23:03:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:49,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:03:49,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:03:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 23:03:49,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:03:49,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:03:49,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212608199] [2024-11-08 23:03:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212608199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:03:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:03:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:03:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130732789] [2024-11-08 23:03:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:03:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:03:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:03:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:03:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:03:49,359 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:03:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:03:51,121 INFO L93 Difference]: Finished difference Result 112 states and 159 transitions. [2024-11-08 23:03:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:03:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-08 23:03:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:03:51,124 INFO L225 Difference]: With dead ends: 112 [2024-11-08 23:03:51,124 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 23:03:51,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:03:51,125 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 51 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:03:51,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 198 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 23:03:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 23:03:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2024-11-08 23:03:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 23:03:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-08 23:03:51,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 92 [2024-11-08 23:03:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:03:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-08 23:03:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:03:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-08 23:03:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:03:51,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:03:51,136 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:03:51,151 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-08 23:03:51,340 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-08 23:03:51,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:03:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:03:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1012915632, now seen corresponding path program 1 times [2024-11-08 23:03:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:03:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088353462] [2024-11-08 23:03:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:03:51,344 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-08 23:03:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:03:51,349 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-08 23:03:51,351 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-08 23:03:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:51,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 23:03:51,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:04:45,301 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:04:51,451 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)