./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.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 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:47:27,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:47:27,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:47:27,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:47:27,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:47:27,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:47:27,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:47:27,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:47:27,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:47:27,853 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:47:27,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:47:27,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:47:27,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:47:27,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:47:27,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:47:27,856 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:47:27,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:27,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:47:27,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 [2025-03-17 02:47:28,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:47:28,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:47:28,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:47:28,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:47:28,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:47:28,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:29,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfffb850/9a73dda870a94e7c936446528c441da3/FLAGdfca59d3b [2025-03-17 02:47:29,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:47:29,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:29,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfffb850/9a73dda870a94e7c936446528c441da3/FLAGdfca59d3b [2025-03-17 02:47:29,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edfffb850/9a73dda870a94e7c936446528c441da3 [2025-03-17 02:47:29,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:47:29,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:47:29,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:29,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:47:29,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:47:29,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:29,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b21774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29, skipping insertion in model container [2025-03-17 02:47:29,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:29,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:47:29,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-17 02:47:29,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:29,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:47:29,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-17 02:47:29,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:29,961 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:47:29,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29 WrapperNode [2025-03-17 02:47:29,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:29,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:29,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:47:29,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:47:29,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:29,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:29,998 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-17 02:47:29,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:29,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:47:29,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:47:29,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:47:30,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,030 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]. [2025-03-17 02:47:30,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:47:30,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:47:30,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:47:30,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:47:30,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (1/1) ... [2025-03-17 02:47:30,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:30,088 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) [2025-03-17 02:47:30,095 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 [2025-03-17 02:47:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:47:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:47:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:47:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:47:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:47:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:47:30,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:47:30,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:47:30,354 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:47:30,354 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:47:30,365 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:47:30,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:47:30,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:30 BoogieIcfgContainer [2025-03-17 02:47:30,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:47:30,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:47:30,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:47:30,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:47:30,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:29" (1/3) ... [2025-03-17 02:47:30,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0fc5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:30, skipping insertion in model container [2025-03-17 02:47:30,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:29" (2/3) ... [2025-03-17 02:47:30,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0fc5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:30, skipping insertion in model container [2025-03-17 02:47:30,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:30" (3/3) ... [2025-03-17 02:47:30,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:30,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:47:30,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-72.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:47:30,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:47:30,442 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;@68f77e89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:47:30,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:47:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:47:30,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:30,457 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:30,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:30,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1014679796, now seen corresponding path program 1 times [2025-03-17 02:47:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844568423] [2025-03-17 02:47:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:30,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:30,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:30,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:47:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844568423] [2025-03-17 02:47:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844568423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:47:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773173639] [2025-03-17 02:47:30,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:47:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:30,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:47:30,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:47:30,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:30,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:30,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:30,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:30,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:47:30,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:47:30,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773173639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:30,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:47:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:47:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034659928] [2025-03-17 02:47:30,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:47:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:47:30,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:30,865 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:47:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:30,887 INFO L93 Difference]: Finished difference Result 87 states and 149 transitions. [2025-03-17 02:47:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:47:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2025-03-17 02:47:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:30,893 INFO L225 Difference]: With dead ends: 87 [2025-03-17 02:47:30,893 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 02:47:30,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:30,899 INFO L435 NwaCegarLoop]: 63 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, 63 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 [2025-03-17 02:47:30,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 02:47:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 02:47:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2025-03-17 02:47:30,932 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 104 [2025-03-17 02:47:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2025-03-17 02:47:30,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:47:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2025-03-17 02:47:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:47:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:30,937 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:30,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:47:31,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:47:31,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:31,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1796343703, now seen corresponding path program 1 times [2025-03-17 02:47:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 02:47:31,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:31,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:31,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:31,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:31,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 02:47:31,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:31,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-17 02:47:31,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120358721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:47:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319912510] [2025-03-17 02:47:31,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:31,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:47:31,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:31,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:47:31,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:47:31,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:31,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:31,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:31,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:31,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:47:31,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-17 02:47:31,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:47:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 02:47:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319912510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:47:32,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:47:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 02:47:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387415500] [2025-03-17 02:47:32,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:47:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:47:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:32,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:47:32,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:47:32,116 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 02:47:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:32,261 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2025-03-17 02:47:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:47:32,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 104 [2025-03-17 02:47:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:32,268 INFO L225 Difference]: With dead ends: 93 [2025-03-17 02:47:32,268 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 02:47:32,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:47:32,269 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:32,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:47:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 02:47:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-17 02:47:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-03-17 02:47:32,282 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 104 [2025-03-17 02:47:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-03-17 02:47:32,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 02:47:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-03-17 02:47:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:47:32,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:32,285 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:32,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:47:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 02:47:32,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1611119912, now seen corresponding path program 1 times [2025-03-17 02:47:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393319804] [2025-03-17 02:47:32,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:32,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:32,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:32,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:47:32,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:47:32,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:32,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:32,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:32,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:47:32,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:47:32,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:47:32,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:47:32,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:47:32,642 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:47:32,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:47:32,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:47:32 BoogieIcfgContainer [2025-03-17 02:47:32,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:47:32,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:47:32,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:47:32,704 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:47:32,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:30" (3/4) ... [2025-03-17 02:47:32,708 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:47:32,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:47:32,710 INFO L158 Benchmark]: Toolchain (without parser) took 2995.90ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 45.5MB in the end (delta: 60.6MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2025-03-17 02:47:32,710 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:32,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.08ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.9MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:47:32,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.99ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:32,711 INFO L158 Benchmark]: Boogie Preprocessor took 43.54ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:32,711 INFO L158 Benchmark]: IcfgBuilder took 322.15ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 73.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:47:32,711 INFO L158 Benchmark]: TraceAbstraction took 2336.49ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 45.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2025-03-17 02:47:32,712 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:32,713 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.08ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 92.9MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.99ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.54ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.15ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 73.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2336.49ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 45.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_8 = 1; [L25] unsigned char var_1_9 = 0; [L26] unsigned long int var_1_10 = 2; [L27] signed char var_1_11 = -16; [L28] signed char var_1_12 = -2; [L29] signed char var_1_13 = -10; [L30] signed char var_1_14 = 4; [L31] double var_1_15 = 256.4; [L32] float var_1_16 = 0.25; [L33] double var_1_17 = 1000000000.2; [L34] double var_1_18 = 50.5; [L35] double var_1_19 = 9.5; [L36] double var_1_20 = 1000000000.4; [L37] signed char var_1_21 = 4; [L38] unsigned short int var_1_22 = 10000; [L39] unsigned char last_1_var_1_1 = 1; [L40] double last_1_var_1_15 = 256.4; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 [L93] last_1_var_1_15 = var_1_15 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_8=1, var_1_9=0] [L65] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=1, var_1_9=0] [L66] var_1_8 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L69] var_1_9 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L75] var_1_13 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_14 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_16=1/4, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_17=5000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L84] var_1_17 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_18 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L88] var_1_19 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L104] RET updateVariables() [L105] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-16, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_1=1, var_1_20=5000000002/5, var_1_21=4, var_1_22=10000, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) [L48] var_1_20 = var_1_19 [L49] var_1_21 = 1 [L50] var_1_22 = 10 VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-1, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=1000000005, var_1_1=1, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L51] COND FALSE !((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-1, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=1000000005, var_1_1=1, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L58] COND TRUE var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L59] var_1_1 = (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-1, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((var_1_20 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((last_1_var_1_1 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_20 + (var_1_20 / var_1_16)) == var_1_20) ? ((var_1_20 >= last_1_var_1_15) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) ((((var_1_17) < ((5.75 + var_1_19))) ? (var_1_17) : ((5.75 + var_1_19))))))) : 1)) && (var_1_20 == ((double) var_1_19))) && (var_1_21 == ((signed char) 1))) && (var_1_22 == ((unsigned short int) 10)) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-1, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1282/5, last_1_var_1_1=1, var_1_10=2, var_1_11=-1, var_1_12=62, var_1_13=-63, var_1_14=11, var_1_15=1282/5, var_1_19=1000000005, var_1_1=0, var_1_20=1000000005, var_1_21=1, var_1_22=10, var_1_6=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 103 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 977 SizeOfPredicates, 1 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2589/2720 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:47:32,728 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.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 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:47:34,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:47:34,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:47:34,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:47:34,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:47:34,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:47:34,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:47:34,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:47:34,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:47:34,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:47:34,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:47:34,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:47:34,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:47:34,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:47:34,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:47:34,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:47:34,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:34,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:47:34,834 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 03b6c8c21580a8ecb4c1565f878b3061aaf6575afb72b6542060848d80b6e4a3 [2025-03-17 02:47:35,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:47:35,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:47:35,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:47:35,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:47:35,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:47:35,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:36,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b201188/0e12eb8776da4ee1a09a3f7f93691aa1/FLAG69fdf50f1 [2025-03-17 02:47:36,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:47:36,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:36,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b201188/0e12eb8776da4ee1a09a3f7f93691aa1/FLAG69fdf50f1 [2025-03-17 02:47:36,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3b201188/0e12eb8776da4ee1a09a3f7f93691aa1 [2025-03-17 02:47:36,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:47:36,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:47:36,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:36,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:47:36,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:47:36,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c43556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36, skipping insertion in model container [2025-03-17 02:47:36,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:47:36,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-17 02:47:36,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:36,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:47:36,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-72.i[917,930] [2025-03-17 02:47:36,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:36,899 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:47:36,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36 WrapperNode [2025-03-17 02:47:36,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:36,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:36,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:47:36,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:47:36,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,934 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 02:47:36,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:36,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:47:36,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:47:36,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:47:36,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,954 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]. [2025-03-17 02:47:36,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:47:36,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:47:36,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:47:36,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:47:36,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (1/1) ... [2025-03-17 02:47:36,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:37,000 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) [2025-03-17 02:47:37,002 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 [2025-03-17 02:47:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:47:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:47:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:47:37,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:47:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:47:37,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:47:37,083 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:47:37,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:47:52,938 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:47:52,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:47:52,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:47:52,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:47:52,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:52 BoogieIcfgContainer [2025-03-17 02:47:52,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:47:52,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:47:52,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:47:52,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:47:52,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:36" (1/3) ... [2025-03-17 02:47:52,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd60ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:52, skipping insertion in model container [2025-03-17 02:47:52,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:36" (2/3) ... [2025-03-17 02:47:52,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd60ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:52, skipping insertion in model container [2025-03-17 02:47:52,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:52" (3/3) ... [2025-03-17 02:47:52,962 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-72.i [2025-03-17 02:47:52,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:47:52,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-72.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:47:53,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:47:53,042 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;@191a16b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:47:53,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:47:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:47:53,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:53,053 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:53,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1014679796, now seen corresponding path program 1 times [2025-03-17 02:47:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540770589] [2025-03-17 02:47:53,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:53,066 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 [2025-03-17 02:47:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:53,068 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) [2025-03-17 02:47:53,069 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 [2025-03-17 02:47:53,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:54,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:54,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:54,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:47:54,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-17 02:47:54,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:54,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540770589] [2025-03-17 02:47:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540770589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:47:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468111105] [2025-03-17 02:47:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:47:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:54,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:47:54,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:54,349 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:47:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:54,365 INFO L93 Difference]: Finished difference Result 87 states and 149 transitions. [2025-03-17 02:47:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:47:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2025-03-17 02:47:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:54,370 INFO L225 Difference]: With dead ends: 87 [2025-03-17 02:47:54,370 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 02:47:54,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:54,373 INFO L435 NwaCegarLoop]: 63 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, 63 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 [2025-03-17 02:47:54,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 02:47:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 02:47:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2025-03-17 02:47:54,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 104 [2025-03-17 02:47:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:54,405 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2025-03-17 02:47:54,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:47:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2025-03-17 02:47:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:47:54,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:54,407 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:54,436 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 [2025-03-17 02:47:54,609 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 [2025-03-17 02:47:54,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1796343703, now seen corresponding path program 1 times [2025-03-17 02:47:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528920056] [2025-03-17 02:47:54,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:54,611 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 [2025-03-17 02:47:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:54,614 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) [2025-03-17 02:47:54,615 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 [2025-03-17 02:47:54,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:47:55,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:47:55,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:55,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:55,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 02:47:55,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-17 02:47:58,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:48:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 02:48:00,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:48:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528920056] [2025-03-17 02:48:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528920056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:48:00,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:48:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 02:48:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906893447] [2025-03-17 02:48:00,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:48:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:48:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:48:00,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:48:00,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:48:00,616 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 02:48:03,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:48:08,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:48:12,417 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 [] [2025-03-17 02:48:16,421 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 [] [2025-03-17 02:48:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:16,423 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2025-03-17 02:48:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:48:16,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 104 [2025-03-17 02:48:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:16,575 INFO L225 Difference]: With dead ends: 93 [2025-03-17 02:48:16,575 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 02:48:16,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:48:16,577 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:48:16,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2025-03-17 02:48:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 02:48:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-17 02:48:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:48:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-03-17 02:48:16,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 104 [2025-03-17 02:48:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-03-17 02:48:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 02:48:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-03-17 02:48:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:48:16,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:16,594 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:48:16,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:48:16,794 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 [2025-03-17 02:48:16,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:16,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1611119912, now seen corresponding path program 1 times [2025-03-17 02:48:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:48:16,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216502350] [2025-03-17 02:48:16,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:16,796 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 [2025-03-17 02:48:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:48:16,799 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) [2025-03-17 02:48:16,800 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 [2025-03-17 02:48:16,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:48:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:48:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:17,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 02:48:17,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:48:36,357 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:48:44,557 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:48:52,882 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) [2025-03-17 02:49:01,286 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:49:09,676 WARN L286 SmtUtils]: Spent 8.39s 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)