./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:22:36,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:22:36,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:22:36,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:22:36,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:22:36,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:22:36,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:22:36,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:22:36,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:22:36,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:22:36,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:22:36,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:22:36,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:22:36,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:22:36,887 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:22:36,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:22:36,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:22:36,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:22:36,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:22:36,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:22:36,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:22:36,889 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-jdk21/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 -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2025-02-06 00:22:37,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:22:37,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:22:37,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:22:37,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:22:37,196 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:22:37,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:38,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52f91a0c0/dd8fa0000234416fab34161df3a49e44/FLAGa15872b84 [2025-02-06 00:22:38,711 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:22:38,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:38,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52f91a0c0/dd8fa0000234416fab34161df3a49e44/FLAGa15872b84 [2025-02-06 00:22:38,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52f91a0c0/dd8fa0000234416fab34161df3a49e44 [2025-02-06 00:22:38,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:22:38,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:22:38,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:22:38,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:22:38,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:22:38,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:22:38" (1/1) ... [2025-02-06 00:22:38,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:38, skipping insertion in model container [2025-02-06 00:22:38,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:22:38" (1/1) ... [2025-02-06 00:22:38,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:22:38,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2025-02-06 00:22:38,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:22:38,964 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:22:38,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2025-02-06 00:22:38,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:22:39,021 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:22:39,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39 WrapperNode [2025-02-06 00:22:39,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:22:39,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:22:39,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:22:39,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:22:39,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,058 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-02-06 00:22:39,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:22:39,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:22:39,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:22:39,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:22:39,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,082 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-02-06 00:22:39,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:22:39,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:22:39,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:22:39,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:22:39,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (1/1) ... [2025-02-06 00:22:39,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:22:39,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:22:39,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:22:39,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:22:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:22:39,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:22:39,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:22:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:22:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:22:39,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:22:39,224 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:22:39,226 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:22:39,453 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 00:22:39,453 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:22:39,465 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:22:39,465 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:22:39,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:22:39 BoogieIcfgContainer [2025-02-06 00:22:39,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:22:39,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:22:39,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:22:39,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:22:39,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:22:38" (1/3) ... [2025-02-06 00:22:39,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f31b568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:22:39, skipping insertion in model container [2025-02-06 00:22:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:39" (2/3) ... [2025-02-06 00:22:39,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f31b568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:22:39, skipping insertion in model container [2025-02-06 00:22:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:22:39" (3/3) ... [2025-02-06 00:22:39,474 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:39,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:22:39,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:22:39,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:22:39,564 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;@225cb35e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:22:39,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:22:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:39,581 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:39,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:39,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-02-06 00:22:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-02-06 00:22:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:39,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:39,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:39,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:39,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 00:22:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:39,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-02-06 00:22:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912251842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:22:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508009837] [2025-02-06 00:22:39,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:22:39,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:22:39,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:22:39,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 00:22:39,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:40,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:40,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:40,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:40,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:22:40,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:22:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 00:22:40,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:22:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508009837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:22:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:22:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943354415] [2025-02-06 00:22:40,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:22:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:22:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:22:40,120 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 00:22:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:40,146 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-06 00:22:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:22:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-02-06 00:22:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:40,154 INFO L225 Difference]: With dead ends: 100 [2025-02-06 00:22:40,154 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 00:22:40,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-02-06 00:22:40,160 INFO L435 NwaCegarLoop]: 73 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, 73 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-02-06 00:22:40,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:22:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 00:22:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 00:22:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-02-06 00:22:40,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-02-06 00:22:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:40,219 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-02-06 00:22:40,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 00:22:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-02-06 00:22:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:40,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:40,225 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:40,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:22:40,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 00:22:40,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:40,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-02-06 00:22:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823636180] [2025-02-06 00:22:40,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:40,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:40,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:40,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:40,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 00:22:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823636180] [2025-02-06 00:22:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823636180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:22:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143561132] [2025-02-06 00:22:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:40,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:22:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:40,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:22:40,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:22:40,689 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 00:22:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:40,734 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2025-02-06 00:22:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:22:40,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-02-06 00:22:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:40,737 INFO L225 Difference]: With dead ends: 142 [2025-02-06 00:22:40,737 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 00:22:40,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:22:40,740 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:40,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:22:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 00:22:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2025-02-06 00:22:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-02-06 00:22:40,755 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2025-02-06 00:22:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-02-06 00:22:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 00:22:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-02-06 00:22:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:40,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:40,760 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:40,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:22:40,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1532463775, now seen corresponding path program 1 times [2025-02-06 00:22:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-02-06 00:22:40,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:40,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:40,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:40,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:40,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 00:22:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:22:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-02-06 00:22:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923784749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:22:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586561612] [2025-02-06 00:22:41,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:22:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:22:41,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:22:41,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:22:41,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:41,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:22:41,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:22:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 00:22:41,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:22:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 00:22:41,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586561612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:22:41,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:22:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 00:22:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441935456] [2025-02-06 00:22:41,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:22:41,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:22:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:22:41,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:22:41,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:22:41,908 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 00:22:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:42,459 INFO L93 Difference]: Finished difference Result 214 states and 296 transitions. [2025-02-06 00:22:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 00:22:42,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-02-06 00:22:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:42,463 INFO L225 Difference]: With dead ends: 214 [2025-02-06 00:22:42,463 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 00:22:42,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:22:42,466 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:42,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 228 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:22:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 00:22:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-02-06 00:22:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-02-06 00:22:42,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-02-06 00:22:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:42,483 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-02-06 00:22:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 00:22:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-02-06 00:22:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:42,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:42,485 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:42,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 00:22:42,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:22:42,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-02-06 00:22:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:22:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-02-06 00:22:42,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:22:42,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:42,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:42,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:42,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:22:42,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:22:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:42,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:42,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:22:42,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:22:42,912 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:22:42,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:22:42,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:22:42,918 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 00:22:42,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:22:43,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:22:43 BoogieIcfgContainer [2025-02-06 00:22:43,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:22:43,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:22:43,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:22:43,001 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:22:43,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:22:39" (3/4) ... [2025-02-06 00:22:43,003 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:22:43,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:22:43,004 INFO L158 Benchmark]: Toolchain (without parser) took 4251.95ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2025-02-06 00:22:43,005 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:22:43,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.27ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:22:43,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:22:43,005 INFO L158 Benchmark]: Boogie Preprocessor took 38.78ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:22:43,006 INFO L158 Benchmark]: IcfgBuilder took 367.85ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 70.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:22:43,006 INFO L158 Benchmark]: TraceAbstraction took 3532.15ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 94.8MB in the end (delta: -24.0MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-02-06 00:22:43,006 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:22:43,007 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.27ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.45ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.78ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 367.85ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 70.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3532.15ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 94.8MB in the end (delta: -24.0MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.7MB in the end (delta: 41.6kB). 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 45, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] float var_1_4 = 255.1; [L24] float var_1_5 = -0.6; [L25] signed short int var_1_6 = -10; [L26] unsigned char var_1_8 = 1; [L27] signed char var_1_11 = -2; [L28] signed char var_1_12 = 10; [L29] signed char var_1_13 = 5; [L30] signed char var_1_14 = -1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 5; [L35] unsigned char var_1_19 = 64; [L36] unsigned char var_1_20 = 5; [L37] unsigned char last_1_var_1_18 = 5; VAL [isInitial=0, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L71] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L72] var_1_5 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L73] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L77] var_1_12 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L80] var_1_13 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L81] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L83] var_1_14 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L84] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L86] var_1_16 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L87] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L89] var_1_17 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L90] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L92] var_1_19 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_19 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L93] RET assume_abort_if_not(var_1_19 >= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L95] var_1_20 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L96] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L97] CALL assume_abort_if_not(var_1_20 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L97] RET assume_abort_if_not(var_1_20 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_0=-6, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L42] COND TRUE last_1_var_1_18 >= stepLocal_0 [L43] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L45] unsigned char stepLocal_1 = (var_1_1 * var_1_5) >= var_1_4; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_1=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L46] COND TRUE var_1_17 && stepLocal_1 [L47] var_1_18 = (2 + ((var_1_19 - var_1_20) + 32)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L51] COND FALSE !(\read(var_1_8)) [L54] var_1_15 = (! var_1_17) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L56] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L59] COND FALSE !(\read(var_1_15)) [L66] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_18 >= (~ last_1_var_1_18)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_15 ? (var_1_15 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_15 ? (var_1_11 == ((signed char) ((var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))) + var_1_14))) : 1)) && (var_1_8 ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) (! var_1_17))))) && ((var_1_17 && ((var_1_1 * var_1_5) >= var_1_4)) ? (var_1_18 == ((unsigned char) (2 + ((var_1_19 - var_1_20) + 32)))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 201 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 154 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 2 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 3584/3672 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-02-06 00:22:43,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:22:45,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:22:45,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:22:45,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:22:45,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:22:45,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:22:45,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:22:45,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:22:45,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:22:45,312 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:22:45,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:22:45,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:22:45,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:22:45,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:22:45,313 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:22:45,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:22:45,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:22:45,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:22:45,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:22:45,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:22:45,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:22:45,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:22:45,316 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:22:45,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:22:45,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:22:45,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:22:45,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:22:45,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:22:45,317 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-jdk21/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 -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2025-02-06 00:22:45,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:22:45,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:22:45,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:22:45,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:22:45,628 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:22:45,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:46,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98d135c33/5742e660205d42808d2e4cc674226be5/FLAG6c62ff8c3 [2025-02-06 00:22:47,175 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:22:47,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:47,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98d135c33/5742e660205d42808d2e4cc674226be5/FLAG6c62ff8c3 [2025-02-06 00:22:47,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98d135c33/5742e660205d42808d2e4cc674226be5 [2025-02-06 00:22:47,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:22:47,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:22:47,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:22:47,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:22:47,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:22:47,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259d294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47, skipping insertion in model container [2025-02-06 00:22:47,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:22:47,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2025-02-06 00:22:47,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:22:47,440 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:22:47,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2025-02-06 00:22:47,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:22:47,485 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:22:47,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47 WrapperNode [2025-02-06 00:22:47,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:22:47,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:22:47,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:22:47,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:22:47,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,530 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-02-06 00:22:47,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:22:47,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:22:47,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:22:47,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:22:47,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,564 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-02-06 00:22:47,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:22:47,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:22:47,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:22:47,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:22:47,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (1/1) ... [2025-02-06 00:22:47,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:22:47,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:22:47,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 00:22:47,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 00:22:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:22:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:22:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:22:47,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:22:47,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:22:47,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:22:47,722 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:22:47,724 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:22:48,402 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 00:22:48,402 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:22:48,414 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:22:48,414 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:22:48,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:22:48 BoogieIcfgContainer [2025-02-06 00:22:48,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:22:48,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:22:48,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:22:48,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:22:48,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:22:47" (1/3) ... [2025-02-06 00:22:48,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2972c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:22:48, skipping insertion in model container [2025-02-06 00:22:48,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:22:47" (2/3) ... [2025-02-06 00:22:48,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2972c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:22:48, skipping insertion in model container [2025-02-06 00:22:48,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:22:48" (3/3) ... [2025-02-06 00:22:48,425 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2025-02-06 00:22:48,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:22:48,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:22:48,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:22:48,493 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;@7caafcb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:22:48,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:22:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:48,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:48,506 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:48,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-02-06 00:22:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:22:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769580057] [2025-02-06 00:22:48,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:48,524 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-02-06 00:22:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:22:48,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 00:22:48,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:22:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:48,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:48,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:48,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:22:48,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:22:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 00:22:48,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:22:48,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:22:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769580057] [2025-02-06 00:22:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769580057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:22:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:22:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:22:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725724032] [2025-02-06 00:22:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:22:48,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:22:48,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:22:48,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:22:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:22:48,864 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 00:22:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:48,908 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-06 00:22:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:22:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-02-06 00:22:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:48,916 INFO L225 Difference]: With dead ends: 100 [2025-02-06 00:22:48,916 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 00:22:48,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-02-06 00:22:48,923 INFO L435 NwaCegarLoop]: 73 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, 73 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-02-06 00:22:48,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:22:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 00:22:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 00:22:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-02-06 00:22:48,966 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-02-06 00:22:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-02-06 00:22:48,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 00:22:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-02-06 00:22:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:48,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:48,972 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:48,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:22:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 00:22:49,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:49,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-02-06 00:22:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:22:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440173746] [2025-02-06 00:22:49,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:49,175 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-02-06 00:22:49,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:22:49,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 00:22:49,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:22:49,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:49,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:49,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:49,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 00:22:49,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:22:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 00:22:49,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:22:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 00:22:49,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:22:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440173746] [2025-02-06 00:22:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440173746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:22:49,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:22:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-06 00:22:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442901973] [2025-02-06 00:22:49,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:22:49,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:22:49,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:22:49,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:22:49,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:22:49,893 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 00:22:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:22:50,972 INFO L93 Difference]: Finished difference Result 213 states and 300 transitions. [2025-02-06 00:22:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 00:22:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-02-06 00:22:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:22:50,976 INFO L225 Difference]: With dead ends: 213 [2025-02-06 00:22:50,976 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 00:22:50,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:22:50,980 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 160 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:22:50,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 185 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:22:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 00:22:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-02-06 00:22:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 00:22:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-02-06 00:22:51,004 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-02-06 00:22:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:22:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-02-06 00:22:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 00:22:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-02-06 00:22:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 00:22:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:22:51,006 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 00:22:51,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:22:51,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 00:22:51,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:22:51,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:22:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-02-06 00:22:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:22:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597197027] [2025-02-06 00:22:51,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:22:51,211 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-02-06 00:22:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:22:51,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 00:22:51,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 00:22:51,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 00:22:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 00:22:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:22:51,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:22:51,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 00:22:51,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:23:39,440 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)