./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-55.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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:32:06,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:32:06,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:32:06,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:32:06,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:32:06,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:32:06,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:32:06,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:32:06,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:32:06,234 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:32:06,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:32:06,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:32:06,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:32:06,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:32:06,235 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:32:06,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:32:06,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:32:06,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:32:06,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:06,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:06,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:32:06,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:32:06,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:32:06,237 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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2025-01-09 12:32:06,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:32:06,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:32:06,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:32:06,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:32:06,507 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:32:06,509 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-55.i [2025-01-09 12:32:07,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6f074f26/11db1af2a9bc4006b80b5736785d1afd/FLAGbdf0eeaa0 [2025-01-09 12:32:07,916 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:32:07,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2025-01-09 12:32:07,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6f074f26/11db1af2a9bc4006b80b5736785d1afd/FLAGbdf0eeaa0 [2025-01-09 12:32:08,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6f074f26/11db1af2a9bc4006b80b5736785d1afd [2025-01-09 12:32:08,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:32:08,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:32:08,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:32:08,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:32:08,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:32:08,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e504230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08, skipping insertion in model container [2025-01-09 12:32:08,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:32:08,393 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-55.i[917,930] [2025-01-09 12:32:08,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:32:08,433 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:32:08,440 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-55.i[917,930] [2025-01-09 12:32:08,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:32:08,466 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:32:08,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08 WrapperNode [2025-01-09 12:32:08,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:32:08,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:32:08,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:32:08,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:32:08,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,493 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-01-09 12:32:08,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:32:08,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:32:08,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:32:08,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:32:08,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,511 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-01-09 12:32:08,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:32:08,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:32:08,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:32:08,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:32:08,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (1/1) ... [2025-01-09 12:32:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:08,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:32:08,556 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-01-09 12:32:08,558 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-01-09 12:32:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:32:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:32:08,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:32:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:32:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:32:08,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:32:08,628 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:32:08,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:32:08,808 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 12:32:08,809 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:32:08,817 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:32:08,818 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:32:08,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:32:08 BoogieIcfgContainer [2025-01-09 12:32:08,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:32:08,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:32:08,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:32:08,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:32:08,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:32:08" (1/3) ... [2025-01-09 12:32:08,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b98bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:32:08, skipping insertion in model container [2025-01-09 12:32:08,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:08" (2/3) ... [2025-01-09 12:32:08,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b98bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:32:08, skipping insertion in model container [2025-01-09 12:32:08,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:32:08" (3/3) ... [2025-01-09 12:32:08,826 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2025-01-09 12:32:08,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:32:08,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-55.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:32:08,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:32:08,898 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;@3683b942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:32:08,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:32:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 12:32:08,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:08,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:08,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:08,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 706184913, now seen corresponding path program 1 times [2025-01-09 12:32:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:32:08,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802430989] [2025-01-09 12:32:08,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:32:08,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 12:32:09,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 12:32:09,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:09,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:32:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:32:09,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802430989] [2025-01-09 12:32:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802430989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:32:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339237852] [2025-01-09 12:32:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:32:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:32:09,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:32:09,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:32:09,263 INFO L87 Difference]: Start difference. First operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:09,306 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2025-01-09 12:32:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:32:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-01-09 12:32:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:09,313 INFO L225 Difference]: With dead ends: 144 [2025-01-09 12:32:09,314 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 12:32:09,316 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-01-09 12:32:09,317 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:32:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 152 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:32:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 12:32:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2025-01-09 12:32:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2025-01-09 12:32:09,348 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 86 [2025-01-09 12:32:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:09,349 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2025-01-09 12:32:09,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2025-01-09 12:32:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 12:32:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:09,353 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 12:32:09,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:09,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash 964350351, now seen corresponding path program 1 times [2025-01-09 12:32:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:32:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061719891] [2025-01-09 12:32:09,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:32:09,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 12:32:09,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 12:32:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:32:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:32:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061719891] [2025-01-09 12:32:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061719891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:32:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349712338] [2025-01-09 12:32:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:32:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:32:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:32:09,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:32:09,529 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:09,574 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2025-01-09 12:32:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:32:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-01-09 12:32:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:09,575 INFO L225 Difference]: With dead ends: 115 [2025-01-09 12:32:09,575 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 12:32:09,575 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-01-09 12:32:09,576 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:32:09,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:32:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 12:32:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 12:32:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2025-01-09 12:32:09,589 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 86 [2025-01-09 12:32:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:09,589 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2025-01-09 12:32:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2025-01-09 12:32:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 12:32:09,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:09,593 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:32:09,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash 944440426, now seen corresponding path program 1 times [2025-01-09 12:32:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:32:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504248968] [2025-01-09 12:32:09,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:32:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 12:32:09,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 12:32:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:32:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:32:10,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504248968] [2025-01-09 12:32:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504248968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:10,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:32:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240538641] [2025-01-09 12:32:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:32:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:32:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:32:10,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:32:10,011 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:10,172 INFO L93 Difference]: Finished difference Result 172 states and 241 transitions. [2025-01-09 12:32:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:32:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-01-09 12:32:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:10,174 INFO L225 Difference]: With dead ends: 172 [2025-01-09 12:32:10,175 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 12:32:10,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:32:10,177 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:32:10,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:32:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 12:32:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-01-09 12:32:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:32:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2025-01-09 12:32:10,198 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 88 [2025-01-09 12:32:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:10,199 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2025-01-09 12:32:10,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2025-01-09 12:32:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 12:32:10,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:10,201 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:10,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:32:10,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1517179834, now seen corresponding path program 1 times [2025-01-09 12:32:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:32:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986985434] [2025-01-09 12:32:10,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:32:10,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 12:32:10,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 12:32:10,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:10,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:32:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:32:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986985434] [2025-01-09 12:32:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986985434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:10,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:10,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:32:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811856367] [2025-01-09 12:32:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:32:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:32:10,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:32:10,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:32:10,851 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:10,946 INFO L93 Difference]: Finished difference Result 204 states and 281 transitions. [2025-01-09 12:32:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:32:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-01-09 12:32:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:10,949 INFO L225 Difference]: With dead ends: 204 [2025-01-09 12:32:10,949 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 12:32:10,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:32:10,952 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:32:10,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 192 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:32:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 12:32:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2025-01-09 12:32:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 103 states have internal predecessors, (130), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:32:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2025-01-09 12:32:10,974 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 90 [2025-01-09 12:32:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:10,974 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2025-01-09 12:32:10,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2025-01-09 12:32:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:32:10,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:10,977 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:32:10,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1886693665, now seen corresponding path program 1 times [2025-01-09 12:32:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:32:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286598319] [2025-01-09 12:32:10,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:32:10,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:32:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:32:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:32:11,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:32:11,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:32:11,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:32:11,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:11,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:32:11,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:32:11,068 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:32:11,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:32:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:32:11,074 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 12:32:11,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:32:11,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:32:11 BoogieIcfgContainer [2025-01-09 12:32:11,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:32:11,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:32:11,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:32:11,141 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:32:11,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:32:08" (3/4) ... [2025-01-09 12:32:11,144 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:32:11,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:32:11,145 INFO L158 Benchmark]: Toolchain (without parser) took 2875.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.5MB in the beginning and 210.8MB in the end (delta: -98.4MB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. [2025-01-09 12:32:11,145 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.33ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.5MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.12ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: RCFGBuilder took 288.37ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: TraceAbstraction took 2320.67ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 75.8MB in the beginning and 211.9MB in the end (delta: -136.1MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2025-01-09 12:32:11,146 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 427.8MB. Free memory was 211.9MB in the beginning and 210.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:32:11,147 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.29ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.33ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.5MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.12ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.37ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2320.67ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 75.8MB in the beginning and 211.9MB in the end (delta: -136.1MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 427.8MB. Free memory was 211.9MB in the beginning and 210.8MB in the end (delta: 1.1MB). 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 shiftRight at line 60, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] double var_1_7 = 256.75; [L26] double var_1_8 = 63.5; [L27] double var_1_9 = 1.8; [L28] double var_1_10 = 0.25; [L29] double var_1_11 = 16.5; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] float var_1_15 = 4.6; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L101] isInitial = 1 [L102] FCALL initially() [L104] CALL updateLastVariables() [L93] last_1_var_1_12 = var_1_12 [L94] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L86] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L88] var_1_18 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L105] RET updateVariables() [L106] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L44] COND FALSE !(stepLocal_1 && var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L54] COND TRUE \read(var_1_2) [L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-256, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L62] COND FALSE !((~ var_1_17) <= stepLocal_3) [L67] var_1_12 = (var_1_17 - var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 297 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1056/1056 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-01-09 12:32:11,166 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-55.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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:32:13,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:32:13,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:32:13,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:32:13,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:32:13,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:32:13,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:32:13,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:32:13,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:32:13,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:32:13,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:32:13,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:32:13,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:32:13,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:32:13,116 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:32:13,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:32:13,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:32:13,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:13,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:32:13,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:13,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:32:13,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:32:13,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:32:13,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:32:13,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:32:13,120 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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2025-01-09 12:32:13,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:32:13,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:32:13,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:32:13,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:32:13,374 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:32:13,375 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-55.i [2025-01-09 12:32:14,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a32ccccd/0e6bd466a2854dfd9b109b1334ac09a3/FLAGe5a61f2ba [2025-01-09 12:32:14,760 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:32:14,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2025-01-09 12:32:14,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a32ccccd/0e6bd466a2854dfd9b109b1334ac09a3/FLAGe5a61f2ba [2025-01-09 12:32:15,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a32ccccd/0e6bd466a2854dfd9b109b1334ac09a3 [2025-01-09 12:32:15,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:32:15,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:32:15,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:32:15,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:32:15,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:32:15,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef33c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15, skipping insertion in model container [2025-01-09 12:32:15,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:32:15,253 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-55.i[917,930] [2025-01-09 12:32:15,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:32:15,314 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:32:15,322 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-55.i[917,930] [2025-01-09 12:32:15,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:32:15,355 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:32:15,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15 WrapperNode [2025-01-09 12:32:15,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:32:15,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:32:15,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:32:15,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:32:15,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,396 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-01-09 12:32:15,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:32:15,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:32:15,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:32:15,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:32:15,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,427 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-01-09 12:32:15,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:32:15,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:32:15,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:32:15,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:32:15,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (1/1) ... [2025-01-09 12:32:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:32:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:32:15,478 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-01-09 12:32:15,480 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-01-09 12:32:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:32:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:32:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:32:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:32:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:32:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:32:15,553 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:32:15,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:32:22,714 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:32:22,714 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:32:22,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:32:22,720 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:32:22,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:32:22 BoogieIcfgContainer [2025-01-09 12:32:22,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:32:22,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:32:22,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:32:22,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:32:22,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:32:15" (1/3) ... [2025-01-09 12:32:22,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f5b2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:32:22, skipping insertion in model container [2025-01-09 12:32:22,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:32:15" (2/3) ... [2025-01-09 12:32:22,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f5b2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:32:22, skipping insertion in model container [2025-01-09 12:32:22,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:32:22" (3/3) ... [2025-01-09 12:32:22,727 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2025-01-09 12:32:22,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:32:22,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-55.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:32:22,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:32:22,790 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;@674b40a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:32:22,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:32:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 12:32:22,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:22,800 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:22,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash -273438843, now seen corresponding path program 1 times [2025-01-09 12:32:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:32:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875388127] [2025-01-09 12:32:22,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:22,818 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-01-09 12:32:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:32:22,820 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-01-09 12:32:22,823 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-01-09 12:32:22,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 12:32:23,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 12:32:23,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:23,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:23,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:32:23,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:32:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-01-09 12:32:23,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:32:23,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:32:23,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875388127] [2025-01-09 12:32:23,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875388127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:32:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634467192] [2025-01-09 12:32:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:32:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:32:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:32:23,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:32:23,193 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:32:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:23,213 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-01-09 12:32:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:32:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-01-09 12:32:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:23,220 INFO L225 Difference]: With dead ends: 84 [2025-01-09 12:32:23,220 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 12:32:23,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-01-09 12:32:23,226 INFO L435 NwaCegarLoop]: 59 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, 59 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-01-09 12:32:23,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:32:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 12:32:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 12:32:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2025-01-09 12:32:23,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81 [2025-01-09 12:32:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-01-09 12:32:23,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 12:32:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2025-01-09 12:32:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 12:32:23,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:23,279 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:23,289 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-01-09 12:32:23,479 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-01-09 12:32:23,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:23,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 638185853, now seen corresponding path program 1 times [2025-01-09 12:32:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:32:23,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840248898] [2025-01-09 12:32:23,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:23,481 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-01-09 12:32:23,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:32:23,483 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-01-09 12:32:23,485 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-01-09 12:32:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 12:32:23,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 12:32:23,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:23,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:23,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:32:23,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:32:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 12:32:23,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:32:23,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:32:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840248898] [2025-01-09 12:32:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840248898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:32:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:32:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:32:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201641975] [2025-01-09 12:32:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:32:23,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:32:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:32:23,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:32:23,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:32:23,787 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:26,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:32:30,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:32:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:32:30,180 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-01-09 12:32:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:32:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-01-09 12:32:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:32:30,207 INFO L225 Difference]: With dead ends: 93 [2025-01-09 12:32:30,207 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 12:32:30,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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-01-09 12:32:30,208 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:32:30,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-01-09 12:32:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 12:32:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2025-01-09 12:32:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 12:32:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-01-09 12:32:30,213 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 81 [2025-01-09 12:32:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:32:30,214 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-01-09 12:32:30,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 12:32:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-01-09 12:32:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 12:32:30,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:32:30,216 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:32:30,226 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 12:32:30,416 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-01-09 12:32:30,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:32:30,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:32:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1881774081, now seen corresponding path program 1 times [2025-01-09 12:32:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:32:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862441929] [2025-01-09 12:32:30,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:32:30,418 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-01-09 12:32:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:32:30,420 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-01-09 12:32:30,421 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-01-09 12:32:30,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 12:32:30,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 12:32:30,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:32:30,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:32:30,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:32:30,692 INFO L279 TraceCheckSpWp]: Computing forward predicates...