./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.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 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:59:22,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:59:22,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:59:22,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:59:22,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:59:22,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:59:22,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:59:22,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:59:22,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:59:22,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:59:22,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:59:22,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:59:22,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:59:22,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:59:22,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:59:22,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:59:22,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:59:22,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:59:22,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:59:22,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:59:22,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:59:22,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:59:22,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:59:22,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:59:22,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:59:22,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:59:22,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:59:22,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:59:22,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:59:22,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:59:22,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:59:22,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:59:22,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:22,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:59:22,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:59:22,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:59:22,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:59:22,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:59:22,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:59:22,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:59:22,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:59:22,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:59:22,092 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 -> 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d [2024-11-20 05:59:22,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:59:22,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:59:22,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:59:22,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:59:22,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:59:22,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:23,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:59:23,799 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:59:23,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:23,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9b8896a/cf5fbe5722a94e069a0be1fd0fcc9754/FLAGc452d77a6 [2024-11-20 05:59:23,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9b8896a/cf5fbe5722a94e069a0be1fd0fcc9754 [2024-11-20 05:59:23,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:59:23,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:59:23,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:23,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:59:23,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:59:23,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:23" (1/1) ... [2024-11-20 05:59:23,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165dd2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:23, skipping insertion in model container [2024-11-20 05:59:23,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:23" (1/1) ... [2024-11-20 05:59:23,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:59:23,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-20 05:59:24,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:24,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:59:24,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-20 05:59:24,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:24,055 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:59:24,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24 WrapperNode [2024-11-20 05:59:24,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:24,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:24,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:59:24,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:59:24,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,095 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 05:59:24,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:24,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:59:24,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:59:24,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:59:24,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,141 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-20 05:59:24,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:59:24,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:59:24,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:59:24,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:59:24,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (1/1) ... [2024-11-20 05:59:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:59:24,265 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-20 05:59:24,270 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-20 05:59:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:59:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:59:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:59:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:59:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:59:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:59:24,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:59:24,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:59:24,703 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 05:59:24,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:59:24,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:59:24,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:59:24,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:24 BoogieIcfgContainer [2024-11-20 05:59:24,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:59:24,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:59:24,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:59:24,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:59:24,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:59:23" (1/3) ... [2024-11-20 05:59:24,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75810a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:24, skipping insertion in model container [2024-11-20 05:59:24,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:24" (2/3) ... [2024-11-20 05:59:24,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75810a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:24, skipping insertion in model container [2024-11-20 05:59:24,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:24" (3/3) ... [2024-11-20 05:59:24,725 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:24,737 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:59:24,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:59:24,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:59:24,802 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67e918e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:59:24,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:59:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:59:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 05:59:24,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:24,830 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:59:24,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:24,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1952648936, now seen corresponding path program 1 times [2024-11-20 05:59:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72061775] [2024-11-20 05:59:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:59:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:59:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:59:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:59:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:59:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72061775] [2024-11-20 05:59:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72061775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:59:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250122962] [2024-11-20 05:59:25,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:59:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:59:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:59:25,228 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:59:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:25,249 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2024-11-20 05:59:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:59:25,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-20 05:59:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:25,270 INFO L225 Difference]: With dead ends: 109 [2024-11-20 05:59:25,270 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 05:59:25,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-20 05:59:25,278 INFO L432 NwaCegarLoop]: 79 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, 79 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-20 05:59:25,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:59:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 05:59:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 05:59:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:59:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-20 05:59:25,369 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 124 [2024-11-20 05:59:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:25,371 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-20 05:59:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:59:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-20 05:59:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 05:59:25,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:25,375 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:59:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:59:25,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:25,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:25,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1910994664, now seen corresponding path program 1 times [2024-11-20 05:59:25,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:25,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323001412] [2024-11-20 05:59:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:59:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:59:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:59:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:59:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:59:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:59:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:59:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:59:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:59:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:59:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:59:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:59:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:59:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:59:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:59:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:59:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:59:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:59:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:59:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 05:59:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:59:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:59:28,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323001412] [2024-11-20 05:59:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323001412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 05:59:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162563869] [2024-11-20 05:59:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:28,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:59:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:59:28,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:59:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:59:28,523 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:59:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:28,738 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-11-20 05:59:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:59:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-11-20 05:59:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:28,740 INFO L225 Difference]: With dead ends: 76 [2024-11-20 05:59:28,740 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 05:59:28,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:28,742 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:59:28,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 343 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:59:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 05:59:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2024-11-20 05:59:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:59:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-20 05:59:28,750 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 124 [2024-11-20 05:59:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:28,751 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-20 05:59:28,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:59:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-20 05:59:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 05:59:28,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:28,753 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:59:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:59:28,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1909147622, now seen corresponding path program 1 times [2024-11-20 05:59:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:59:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317779349] [2024-11-20 05:59:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:59:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:59:28,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:59:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:59:28,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:59:28,858 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:59:28,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:59:28,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:59:28,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 05:59:28,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:59:28,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:59:28 BoogieIcfgContainer [2024-11-20 05:59:28,926 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:59:28,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:59:28,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:59:28,926 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:59:28,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:24" (3/4) ... [2024-11-20 05:59:28,929 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:59:28,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:59:28,930 INFO L158 Benchmark]: Toolchain (without parser) took 5108.87ms. Allocated memory was 146.8MB in the beginning and 310.4MB in the end (delta: 163.6MB). Free memory was 78.3MB in the beginning and 172.6MB in the end (delta: -94.3MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,931 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 146.8MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:59:28,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.23ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 63.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.36ms. Allocated memory is still 146.8MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,932 INFO L158 Benchmark]: Boogie Preprocessor took 95.20ms. Allocated memory is still 146.8MB. Free memory was 60.5MB in the beginning and 55.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,932 INFO L158 Benchmark]: RCFGBuilder took 525.85ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 55.8MB in the beginning and 173.4MB in the end (delta: -117.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,932 INFO L158 Benchmark]: TraceAbstraction took 4205.80ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 172.4MB in the beginning and 173.7MB in the end (delta: -1.3MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. [2024-11-20 05:59:28,933 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 310.4MB. Free memory was 173.7MB in the beginning and 172.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:59:28,935 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.13ms. Allocated memory is still 146.8MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.23ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 63.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.36ms. Allocated memory is still 146.8MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.20ms. Allocated memory is still 146.8MB. Free memory was 60.5MB in the beginning and 55.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 525.85ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 55.8MB in the beginning and 173.4MB in the end (delta: -117.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4205.80ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 172.4MB in the beginning and 173.7MB in the end (delta: -1.3MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 310.4MB. Free memory was 173.7MB in the beginning and 172.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed long int var_1_2 = 50; [L24] signed long int var_1_3 = 7; [L25] signed char var_1_7 = 10; [L26] signed long int var_1_8 = 32; [L27] signed long int var_1_9 = 1000000; [L28] signed long int var_1_10 = 2; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=50, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=50, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L70] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L71] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L71] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L72] var_1_3 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L73] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L74] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L74] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L76] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L77] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L77] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L93] var_1_16 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L95] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L112] RET updateVariables() [L113] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L49] COND TRUE var_1_8 <= var_1_8 [L50] var_1_11 = (var_1_12 || var_1_13) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-251, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((signed long int) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((signed long int) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-251, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-251, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-251, var_1_15=5, var_1_16=-251, var_1_17=254, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 422 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 150 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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-20 05:59:28,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.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 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:59:31,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:59:31,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:59:31,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:59:31,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:59:31,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:59:31,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:59:31,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:59:31,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:59:31,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:59:31,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:59:31,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:59:31,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:59:31,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:59:31,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:59:31,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:59:31,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:59:31,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:59:31,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:59:31,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:59:31,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:59:31,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:59:31,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:59:31,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:59:31,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:59:31,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:59:31,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:59:31,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:59:31,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:59:31,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:59:31,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:59:31,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:59:31,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:59:31,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:59:31,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:31,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:59:31,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:59:31,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:59:31,180 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:59:31,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:59:31,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:59:31,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:59:31,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:59:31,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:59:31,183 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 -> 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d [2024-11-20 05:59:31,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:59:31,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:59:31,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:59:31,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:59:31,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:59:31,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:32,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:59:33,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:59:33,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:33,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57078c9a/4c994f5b151648bdae6accc41b4ba0c3/FLAG268f0237b [2024-11-20 05:59:33,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57078c9a/4c994f5b151648bdae6accc41b4ba0c3 [2024-11-20 05:59:33,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:59:33,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:59:33,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:33,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:59:33,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:59:33,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4914e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33, skipping insertion in model container [2024-11-20 05:59:33,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:59:33,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-20 05:59:33,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:33,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:59:33,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-20 05:59:33,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:59:33,542 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:59:33,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33 WrapperNode [2024-11-20 05:59:33,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:59:33,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:33,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:59:33,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:59:33,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,582 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-20 05:59:33,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:59:33,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:59:33,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:59:33,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:59:33,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,624 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-20 05:59:33,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:59:33,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:59:33,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:59:33,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:59:33,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (1/1) ... [2024-11-20 05:59:33,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:59:33,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:59:33,710 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-20 05:59:33,712 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-20 05:59:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:59:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:59:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:59:33,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:59:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:59:33,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:59:33,816 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:59:33,818 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:59:47,558 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 05:59:47,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:59:47,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:59:47,571 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:59:47,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:47 BoogieIcfgContainer [2024-11-20 05:59:47,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:59:47,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:59:47,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:59:47,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:59:47,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:59:33" (1/3) ... [2024-11-20 05:59:47,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716710f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:47, skipping insertion in model container [2024-11-20 05:59:47,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:59:33" (2/3) ... [2024-11-20 05:59:47,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716710f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:59:47, skipping insertion in model container [2024-11-20 05:59:47,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:59:47" (3/3) ... [2024-11-20 05:59:47,578 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-20 05:59:47,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:59:47,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:59:47,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:59:47,649 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;@70a5c388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:59:47,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:59:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:59:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 05:59:47,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:47,668 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:59:47,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1952648936, now seen corresponding path program 1 times [2024-11-20 05:59:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:59:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314421080] [2024-11-20 05:59:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:47,690 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-20 05:59:47,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:59:47,696 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-20 05:59:47,697 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-20 05:59:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:48,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:59:48,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:59:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-20 05:59:48,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:59:48,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:59:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314421080] [2024-11-20 05:59:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314421080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:59:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:59:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:59:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409462442] [2024-11-20 05:59:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:59:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:59:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:59:48,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:59:48,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:59:48,196 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:59:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:59:48,221 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2024-11-20 05:59:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:59:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-20 05:59:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:59:48,228 INFO L225 Difference]: With dead ends: 109 [2024-11-20 05:59:48,229 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 05:59:48,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-20 05:59:48,235 INFO L432 NwaCegarLoop]: 79 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, 79 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-20 05:59:48,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:59:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 05:59:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 05:59:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:59:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-20 05:59:48,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 124 [2024-11-20 05:59:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:59:48,278 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-20 05:59:48,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:59:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-20 05:59:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 05:59:48,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:59:48,285 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:59:48,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 05:59:48,486 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-20 05:59:48,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:59:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:59:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1910994664, now seen corresponding path program 1 times [2024-11-20 05:59:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:59:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227424332] [2024-11-20 05:59:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:59:48,490 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-20 05:59:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:59:48,493 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-20 05:59:48,495 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-20 05:59:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:59:48,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:59:48,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:59:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-20 05:59:50,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:59:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 05:59:52,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:59:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227424332] [2024-11-20 05:59:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227424332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:59:52,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:59:52,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-20 05:59:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620899795] [2024-11-20 05:59:52,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:59:52,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:59:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:59:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:59:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:59:52,522 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 05:59:58,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:00:02,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:00:06,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:00:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:06,841 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2024-11-20 06:00:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:00:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 124 [2024-11-20 06:00:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:06,966 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:00:06,966 INFO L226 Difference]: Without dead ends: 60 [2024-11-20 06:00:06,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:00:06,971 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 95 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 100 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:06,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 106 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2024-11-20 06:00:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-20 06:00:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-20 06:00:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 06:00:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-11-20 06:00:06,999 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 124 [2024-11-20 06:00:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:07,000 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-11-20 06:00:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:00:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-11-20 06:00:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 06:00:07,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:07,005 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:00:07,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:00:07,209 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-20 06:00:07,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1909147622, now seen corresponding path program 1 times [2024-11-20 06:00:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:00:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344178532] [2024-11-20 06:00:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:07,214 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-20 06:00:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:00:07,218 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-20 06:00:07,219 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-20 06:00:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:07,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 06:00:07,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:00:18,153 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:26,426 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:34,604 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:42,886 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:46,953 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv1 8) c_~var_1_11~0) (not (bvsge c_~var_1_3~0 c_~var_1_2~0)) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (not (fp.lt (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false [2024-11-20 06:00:51,046 WARN L873 $PredicateComparison]: unable to prove that (and (= (_ bv1 8) c_~var_1_11~0) (not (bvsge c_~var_1_3~0 c_~var_1_2~0)) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (not (fp.lt (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true [2024-11-20 06:00:59,377 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)