./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:45:51,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:45:51,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:45:51,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:45:51,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:45:51,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:45:51,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:45:51,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:45:51,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:45:51,998 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:45:51,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:45:51,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:45:51,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:45:51,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:45:51,999 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:45:52,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:45:52,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:45:52,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:45:52,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:45:52,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:45:52,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:45:52,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:45:52,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:45:52,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:45:52,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2025-03-17 02:45:52,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:45:52,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:45:52,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:45:52,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:45:52,266 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:45:52,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:45:53,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7cfdb4a/27fa856f46f6439089bec25dcfe8cf61/FLAGc1816f39c [2025-03-17 02:45:53,729 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:45:53,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:45:53,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7cfdb4a/27fa856f46f6439089bec25dcfe8cf61/FLAGc1816f39c [2025-03-17 02:45:53,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7cfdb4a/27fa856f46f6439089bec25dcfe8cf61 [2025-03-17 02:45:53,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:45:53,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:45:53,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:45:53,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:45:53,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:45:53,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:53,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53, skipping insertion in model container [2025-03-17 02:45:53,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:53,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:45:53,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2025-03-17 02:45:53,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:45:53,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:45:53,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2025-03-17 02:45:53,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:45:53,967 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:45:53,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53 WrapperNode [2025-03-17 02:45:53,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:45:53,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:45:53,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:45:53,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:45:53,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:53,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,015 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-17 02:45:54,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:45:54,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:45:54,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:45:54,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:45:54,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,048 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:45:54,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:45:54,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:45:54,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:45:54,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:45:54,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (1/1) ... [2025-03-17 02:45:54,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:45:54,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:45:54,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:45:54,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:45:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:45:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:45:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:45:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:45:54,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:45:54,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:45:54,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:45:54,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:45:54,451 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:45:54,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:45:54,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:45:54,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:45:54,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:45:54 BoogieIcfgContainer [2025-03-17 02:45:54,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:45:54,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:45:54,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:45:54,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:45:54,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:45:53" (1/3) ... [2025-03-17 02:45:54,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:45:54, skipping insertion in model container [2025-03-17 02:45:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:45:53" (2/3) ... [2025-03-17 02:45:54,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:45:54, skipping insertion in model container [2025-03-17 02:45:54,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:45:54" (3/3) ... [2025-03-17 02:45:54,469 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:45:54,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:45:54,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-6.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:45:54,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:45:54,533 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;@76951a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:45:54,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:45:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:45:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:45:54,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:45:54,543 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:45:54,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:45:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:45:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1807160114, now seen corresponding path program 1 times [2025-03-17 02:45:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:45:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839667088] [2025-03-17 02:45:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:45:54,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:45:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:45:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:54,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:45:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 02:45:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:45:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839667088] [2025-03-17 02:45:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839667088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:45:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673914995] [2025-03-17 02:45:54,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:45:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:45:54,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:45:54,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:45:54,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:45:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:45:54,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:54,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:45:54,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:45:54,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:45:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 02:45:54,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:45:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673914995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:45:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:45:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:45:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-17 02:45:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:45:54,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:45:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:45:54,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:45:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:45:54,984 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:45:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:45:55,010 INFO L93 Difference]: Finished difference Result 97 states and 169 transitions. [2025-03-17 02:45:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:45:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 02:45:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:45:55,019 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:45:55,019 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:45:55,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:45:55,027 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:45:55,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:45:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:45:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:45:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:45:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2025-03-17 02:45:55,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 116 [2025-03-17 02:45:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:45:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2025-03-17 02:45:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:45:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2025-03-17 02:45:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:45:55,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:45:55,076 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:45:55,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:45:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:45:55,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:45:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:45:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1502037513, now seen corresponding path program 1 times [2025-03-17 02:45:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:45:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267004906] [2025-03-17 02:45:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:45:55,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:45:55,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:45:55,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:55,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:45:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:45:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:45:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267004906] [2025-03-17 02:45:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267004906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:45:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:45:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:45:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332200271] [2025-03-17 02:45:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:45:55,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:45:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:45:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:45:55,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:45:55,759 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:45:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:45:55,851 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2025-03-17 02:45:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:45:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2025-03-17 02:45:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:45:55,855 INFO L225 Difference]: With dead ends: 95 [2025-03-17 02:45:55,855 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:45:55,856 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-03-17 02:45:55,856 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:45:55,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:45:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:45:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:45:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:45:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 02:45:55,863 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2025-03-17 02:45:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:45:55,864 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 02:45:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:45:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 02:45:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:45:55,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:45:55,866 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:45:55,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:45:55,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:45:55,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:45:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1530666664, now seen corresponding path program 1 times [2025-03-17 02:45:55,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:45:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 02:45:55,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:45:55,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:45:55,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:45:55,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:55,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:45:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:45:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:45:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 02:45:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217811552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:45:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:45:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:45:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104022793] [2025-03-17 02:45:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:45:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:45:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:45:56,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:45:56,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:45:56,072 INFO L87 Difference]: Start difference. First operand 48 states and 71 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:45:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:45:56,119 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2025-03-17 02:45:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:45:56,121 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2025-03-17 02:45:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:45:56,122 INFO L225 Difference]: With dead ends: 128 [2025-03-17 02:45:56,122 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 02:45:56,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-17 02:45:56,123 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:45:56,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:45:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 02:45:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-17 02:45:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:45:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-17 02:45:56,148 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 116 [2025-03-17 02:45:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:45:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-17 02:45:56,150 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:45:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-17 02:45:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:45:56,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:45:56,152 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:45:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:45:56,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:45:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:45:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1876796951, now seen corresponding path program 1 times [2025-03-17 02:45:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:45:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-03-17 02:45:56,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:45:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:45:56,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:45:56,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:45:56,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:45:56,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-03-17 02:46:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528047602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:46:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193086714] [2025-03-17 02:46:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:46:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:00,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:46:00,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:46:00,733 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:02,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 02:46:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:03,369 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-03-17 02:46:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:46:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2025-03-17 02:46:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:03,376 INFO L225 Difference]: With dead ends: 164 [2025-03-17 02:46:03,376 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 02:46:03,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:46:03,376 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 65 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:03,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 246 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 02:46:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 02:46:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2025-03-17 02:46:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 90 states have (on average 1.2) internal successors, (108), 92 states have internal predecessors, (108), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 02:46:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2025-03-17 02:46:03,398 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 116 [2025-03-17 02:46:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:03,398 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2025-03-17 02:46:03,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2025-03-17 02:46:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 02:46:03,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:03,400 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:03,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:46:03,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1947944889, now seen corresponding path program 1 times [2025-03-17 02:46:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-03-17 02:46:03,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:03,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:03,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:04,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-03-17 02:46:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696342524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:04,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:46:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958394553] [2025-03-17 02:46:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:04,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:46:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:04,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:46:04,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:46:04,467 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:04,880 INFO L93 Difference]: Finished difference Result 369 states and 541 transitions. [2025-03-17 02:46:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:46:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-03-17 02:46:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:04,885 INFO L225 Difference]: With dead ends: 369 [2025-03-17 02:46:04,885 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 02:46:04,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:46:04,889 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:04,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 223 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:46:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 02:46:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2025-03-17 02:46:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 02:46:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2025-03-17 02:46:04,923 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 117 [2025-03-17 02:46:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2025-03-17 02:46:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2025-03-17 02:46:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 02:46:04,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:04,927 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:04,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:46:04,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1947974680, now seen corresponding path program 1 times [2025-03-17 02:46:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:04,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-03-17 02:46:04,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:04,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:04,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:06,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-03-17 02:46:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373904381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:06,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:06,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:46:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063668488] [2025-03-17 02:46:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:06,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:46:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:06,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:46:06,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:06,858 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:07,757 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-17 02:46:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:46:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-03-17 02:46:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:07,763 INFO L225 Difference]: With dead ends: 218 [2025-03-17 02:46:07,763 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 02:46:07,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:46:07,767 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:07,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 305 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:46:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 02:46:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2025-03-17 02:46:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 02:46:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2025-03-17 02:46:07,791 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 117 [2025-03-17 02:46:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2025-03-17 02:46:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2025-03-17 02:46:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 02:46:07,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:07,794 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:07,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:46:07,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:07,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1464968137, now seen corresponding path program 1 times [2025-03-17 02:46:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-17 02:46:07,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:07,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:07,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:07,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-17 02:46:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468824238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:09,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:46:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166232221] [2025-03-17 02:46:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:09,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:46:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:46:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:46:09,327 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:09,590 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2025-03-17 02:46:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:46:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-03-17 02:46:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:09,592 INFO L225 Difference]: With dead ends: 245 [2025-03-17 02:46:09,592 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 02:46:09,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:09,593 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:09,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 222 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:46:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 02:46:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 210. [2025-03-17 02:46:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 125 states have (on average 1.216) internal successors, (152), 127 states have internal predecessors, (152), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 02:46:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 310 transitions. [2025-03-17 02:46:09,620 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 310 transitions. Word has length 117 [2025-03-17 02:46:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 310 transitions. [2025-03-17 02:46:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 310 transitions. [2025-03-17 02:46:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 02:46:09,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:09,623 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:46:09,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -577464456, now seen corresponding path program 1 times [2025-03-17 02:46:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251970171] [2025-03-17 02:46:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:09,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:09,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:09,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:09,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251970171] [2025-03-17 02:46:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251970171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:13,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:46:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385892] [2025-03-17 02:46:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:46:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:13,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:46:13,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:46:13,271 INFO L87 Difference]: Start difference. First operand 210 states and 310 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:14,811 INFO L93 Difference]: Finished difference Result 234 states and 335 transitions. [2025-03-17 02:46:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:46:14,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2025-03-17 02:46:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:14,816 INFO L225 Difference]: With dead ends: 234 [2025-03-17 02:46:14,816 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 02:46:14,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:46:14,817 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 66 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:14,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 314 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 02:46:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 02:46:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2025-03-17 02:46:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.218045112781955) internal successors, (162), 135 states have internal predecessors, (162), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 02:46:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2025-03-17 02:46:14,846 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 117 [2025-03-17 02:46:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:14,846 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2025-03-17 02:46:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2025-03-17 02:46:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 02:46:14,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:14,848 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:14,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:46:14,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 277842198, now seen corresponding path program 1 times [2025-03-17 02:46:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848710829] [2025-03-17 02:46:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:14,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:14,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:14,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:46:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362739845] [2025-03-17 02:46:14,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:14,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:46:14,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:46:14,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:15,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:15,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:15,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:15,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:46:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 02:46:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 02:46:15,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:15,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:15,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:46:15,414 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:46:15,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:46:15,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:46:15,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 02:46:15,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:15,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:46:15,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:46:15 BoogieIcfgContainer [2025-03-17 02:46:15,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:46:15,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:46:15,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:46:15,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:46:15,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:45:54" (3/4) ... [2025-03-17 02:46:15,699 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:46:15,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:46:15,700 INFO L158 Benchmark]: Toolchain (without parser) took 21952.20ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 132.9MB in the beginning and 176.6MB in the end (delta: -43.6MB). Peak memory consumption was 215.5MB. Max. memory is 16.1GB. [2025-03-17 02:46:15,700 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.55ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: Boogie Preprocessor took 35.26ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: IcfgBuilder took 405.17ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 96.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: TraceAbstraction took 21232.72ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 95.3MB in the beginning and 176.7MB in the end (delta: -81.4MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. [2025-03-17 02:46:15,701 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 427.8MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 133.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:15,702 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.55ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.55ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.26ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 405.17ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 96.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21232.72ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 95.3MB in the beginning and 176.7MB in the end (delta: -81.4MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 427.8MB. Free memory was 176.7MB in the beginning and 176.6MB in the end (delta: 133.9kB). 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 someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned short int var_1_4 = 32; [L24] unsigned short int var_1_6 = 10; [L25] signed long int var_1_7 = 4; [L26] signed long int var_1_8 = 2; [L27] double var_1_9 = 0.0; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 0.0; [L30] double var_1_12 = 0.25; [L31] unsigned short int var_1_13 = 36833; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] signed long int var_1_18 = -32; [L36] unsigned long int var_1_20 = 50; [L37] unsigned long int var_1_21 = 2655070710; [L38] unsigned char last_1_var_1_14 = 0; [L39] signed long int last_1_var_1_18 = -32; [L40] unsigned long int last_1_var_1_20 = 50; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] last_1_var_1_14 = var_1_14 [L102] last_1_var_1_18 = var_1_18 [L103] last_1_var_1_20 = var_1_20 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_7 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 <= 17) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_8 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16, var_1_9=0] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L80] RET assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [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.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [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.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L87] var_1_13 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L88] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L89] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L89] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L96] var_1_21 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L97] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L98] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L98] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE (var_1_4 - last_1_var_1_20) == last_1_var_1_18 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L45] COND FALSE !(((var_1_9 - var_1_10) - var_1_11) > var_1_12) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L51] COND TRUE var_1_13 > var_1_6 [L52] var_1_18 = (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L54] COND FALSE !(\read(last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L57] var_1_20 = ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))) [L58] unsigned long int stepLocal_1 = var_1_20; [L59] unsigned long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, stepLocal_1=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L60] COND FALSE !((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > stepLocal_1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > var_1_20) ? ((var_1_20 == var_1_18) ? (var_1_1 == ((unsigned long int) 1000000000u)) : (var_1_1 == ((unsigned long int) 128u))) : 1) && (((var_1_4 - last_1_var_1_20) == last_1_var_1_18) ? ((((var_1_9 - var_1_10) - var_1_11) > var_1_12) ? (var_1_6 == ((unsigned short int) (var_1_13 - var_1_8))) : 1) : (var_1_6 == ((unsigned short int) var_1_13)))) && (last_1_var_1_14 ? (var_1_14 == ((unsigned char) (var_1_16 && var_1_17))) : 1)) && ((var_1_13 > var_1_6) ? (var_1_18 == ((signed long int) (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6))) : 1)) && (var_1_20 == ((unsigned long int) ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=-2, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=261993005054, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 95 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 1614 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1038 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 576 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1282 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 5528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 6120/6156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:46:15,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:46:17,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:17,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:46:17,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:17,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:17,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:17,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:17,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:17,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:17,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:17,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:17,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:17,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:17,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:17,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:17,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:17,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:17,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:17,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:17,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:17,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:17,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:17,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:17,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:17,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:17,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:17,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:17,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2025-03-17 02:46:18,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:18,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:18,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:18,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:18,139 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:18,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:46:19,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae253727/353128d1e9604d49a9b6ee0154221589/FLAG1002dad25 [2025-03-17 02:46:19,616 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:46:19,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:46:19,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae253727/353128d1e9604d49a9b6ee0154221589/FLAG1002dad25 [2025-03-17 02:46:19,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae253727/353128d1e9604d49a9b6ee0154221589 [2025-03-17 02:46:19,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:46:19,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:46:19,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:19,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:46:19,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:46:19,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12303581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19, skipping insertion in model container [2025-03-17 02:46:19,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:46:19,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2025-03-17 02:46:19,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:19,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:46:19,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2025-03-17 02:46:19,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:19,837 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:46:19,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19 WrapperNode [2025-03-17 02:46:19,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:19,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:19,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:46:19,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:46:19,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,866 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-17 02:46:19,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:19,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:46:19,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:46:19,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:46:19,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:46:19,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:46:19,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:46:19,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:46:19,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:46:19,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (1/1) ... [2025-03-17 02:46:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:19,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:46:19,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:46:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:46:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:46:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:46:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:46:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:46:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:46:20,020 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:46:20,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:46:23,445 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:46:23,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:46:23,457 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:46:23,457 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:46:23,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:23 BoogieIcfgContainer [2025-03-17 02:46:23,458 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:46:23,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:46:23,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:46:23,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:46:23,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:46:19" (1/3) ... [2025-03-17 02:46:23,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143be7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:23, skipping insertion in model container [2025-03-17 02:46:23,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:19" (2/3) ... [2025-03-17 02:46:23,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143be7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:23, skipping insertion in model container [2025-03-17 02:46:23,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:23" (3/3) ... [2025-03-17 02:46:23,467 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2025-03-17 02:46:23,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:46:23,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-6.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:46:23,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:46:23,544 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;@6925438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:46:23,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:46:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:46:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:46:23,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:23,557 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:23,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1807160114, now seen corresponding path program 1 times [2025-03-17 02:46:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609032287] [2025-03-17 02:46:23,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:23,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:46:23,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:46:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:46:23,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:46:23,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:23,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:23,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:46:23,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-17 02:46:23,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:23,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:46:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609032287] [2025-03-17 02:46:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609032287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:23,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:46:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091834608] [2025-03-17 02:46:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:23,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:46:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:46:23,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:46:23,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:23,954 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:46:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:23,968 INFO L93 Difference]: Finished difference Result 97 states and 169 transitions. [2025-03-17 02:46:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:46:23,971 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 02:46:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:23,975 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:46:23,975 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:46:23,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:23,980 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:23,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:46:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:46:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 02:46:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2025-03-17 02:46:24,017 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 116 [2025-03-17 02:46:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:24,018 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2025-03-17 02:46:24,019 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 02:46:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2025-03-17 02:46:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:46:24,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:24,022 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:24,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:46:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:24,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:24,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1502037513, now seen corresponding path program 1 times [2025-03-17 02:46:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812409217] [2025-03-17 02:46:24,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:24,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:46:24,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:46:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:46:24,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:46:24,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:24,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:24,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:46:24,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:24,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:24,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:46:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812409217] [2025-03-17 02:46:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812409217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:46:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321594935] [2025-03-17 02:46:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:46:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:46:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:46:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:46:24,525 INFO L87 Difference]: Start difference. First operand 48 states and 72 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:26,089 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2025-03-17 02:46:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:46:26,090 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2025-03-17 02:46:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:26,091 INFO L225 Difference]: With dead ends: 128 [2025-03-17 02:46:26,091 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 02:46:26,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-03-17 02:46:26,093 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:26,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 02:46:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 02:46:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-17 02:46:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:46:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2025-03-17 02:46:26,104 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 116 [2025-03-17 02:46:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:26,105 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2025-03-17 02:46:26,105 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2025-03-17 02:46:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:46:26,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:26,106 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:26,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:46:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:26,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:26,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1905426102, now seen corresponding path program 1 times [2025-03-17 02:46:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81072619] [2025-03-17 02:46:26,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:26,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:26,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:26,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:46:26,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:46:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:46:26,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:46:26,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:26,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:26,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:46:26,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 02:46:27,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:27,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:46:27,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81072619] [2025-03-17 02:46:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81072619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:27,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:27,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:46:27,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369723696] [2025-03-17 02:46:27,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:27,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:46:27,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:46:27,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:46:27,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:46:27,051 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:27,875 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2025-03-17 02:46:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:46:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2025-03-17 02:46:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:27,896 INFO L225 Difference]: With dead ends: 155 [2025-03-17 02:46:27,896 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 02:46:27,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-03-17 02:46:27,897 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:27,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 02:46:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 02:46:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 02:46:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 02:46:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2025-03-17 02:46:27,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 116 [2025-03-17 02:46:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:27,909 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2025-03-17 02:46:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 02:46:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2025-03-17 02:46:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 02:46:27,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:27,913 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:46:27,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:46:28,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:28,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:28,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1876796951, now seen corresponding path program 1 times [2025-03-17 02:46:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143025743] [2025-03-17 02:46:28,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:46:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:28,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:46:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 02:46:28,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 02:46:28,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 02:46:28,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:28,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:28,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 02:46:28,335 INFO L279 TraceCheckSpWp]: Computing forward predicates...