./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:22:07,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:22:07,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:22:07,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:22:07,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:22:07,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:22:07,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:22:07,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:22:07,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:22:07,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:22:07,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:22:07,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:22:07,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:22:07,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:22:07,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:22:07,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:22:07,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:07,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:07,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:22:07,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:22:07,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:22:07,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:22:07,721 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 [2025-01-09 12:22:07,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:22:07,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:22:07,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:22:07,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:22:07,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:22:07,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:09,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60560bc05/fc98cb2e5d034eb98892d753fdf128ef/FLAGebfaefc59 [2025-01-09 12:22:09,362 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:22:09,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:09,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60560bc05/fc98cb2e5d034eb98892d753fdf128ef/FLAGebfaefc59 [2025-01-09 12:22:09,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60560bc05/fc98cb2e5d034eb98892d753fdf128ef [2025-01-09 12:22:09,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:22:09,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:22:09,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:22:09,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:22:09,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:22:09,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09, skipping insertion in model container [2025-01-09 12:22:09,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:22:09,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i[913,926] [2025-01-09 12:22:09,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:22:09,849 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:22:09,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i[913,926] [2025-01-09 12:22:09,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:22:09,906 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:22:09,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09 WrapperNode [2025-01-09 12:22:09,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:22:09,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:22:09,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:22:09,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:22:09,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,938 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 12:22:09,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:22:09,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:22:09,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:22:09,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:22:09,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,955 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:22:09,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:22:09,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:22:09,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:22:09,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:22:09,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (1/1) ... [2025-01-09 12:22:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:22:09,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:22:09,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:22:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:22:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:22:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:22:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:22:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:22:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:22:10,071 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:22:10,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:22:10,266 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:22:10,266 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:22:10,272 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:22:10,272 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:22:10,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:10 BoogieIcfgContainer [2025-01-09 12:22:10,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:22:10,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:22:10,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:22:10,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:22:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:22:09" (1/3) ... [2025-01-09 12:22:10,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a315bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:10, skipping insertion in model container [2025-01-09 12:22:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:09" (2/3) ... [2025-01-09 12:22:10,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a315bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:10, skipping insertion in model container [2025-01-09 12:22:10,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:10" (3/3) ... [2025-01-09 12:22:10,280 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:10,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:22:10,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-73.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:22:10,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:22:10,341 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;@70a87586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:22:10,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:22:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:22:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:22:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:10,355 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:10,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:10,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1908203776, now seen corresponding path program 1 times [2025-01-09 12:22:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:22:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-01-09 12:22:10,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:22:10,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:10,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 12:22:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:22:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-01-09 12:22:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129059309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:22:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319536106] [2025-01-09 12:22:10,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:22:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:22:10,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:22:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:22:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:10,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:10,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:22:10,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:22:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 12:22:10,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:22:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319536106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:22:10,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:22:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:22:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130143308] [2025-01-09 12:22:10,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:22:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:22:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:22:10,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:22:10,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:22:10,761 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:22:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:22:10,776 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2025-01-09 12:22:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:22:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-01-09 12:22:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:22:10,785 INFO L225 Difference]: With dead ends: 134 [2025-01-09 12:22:10,785 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 12:22:10,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:22:10,789 INFO L435 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:22:10,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:22:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 12:22:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 12:22:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:22:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-01-09 12:22:10,814 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 139 [2025-01-09 12:22:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:22:10,814 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-01-09 12:22:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:22:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-01-09 12:22:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:22:10,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:10,816 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:10,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:22:11,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:22:11,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash 562805950, now seen corresponding path program 1 times [2025-01-09 12:22:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:22:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550103354] [2025-01-09 12:22:11,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:22:11,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:11,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:11,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:22:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:22:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550103354] [2025-01-09 12:22:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550103354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:22:12,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549573705] [2025-01-09 12:22:12,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:22:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:22:12,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:22:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:22:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:12,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 12:22:12,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:22:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 12:22:12,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:22:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:22:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549573705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:22:14,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:22:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 12:22:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361571358] [2025-01-09 12:22:14,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:22:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:22:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:22:14,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:22:14,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:22:14,478 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 12:22:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:22:15,763 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2025-01-09 12:22:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 12:22:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) Word has length 139 [2025-01-09 12:22:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:22:15,769 INFO L225 Difference]: With dead ends: 356 [2025-01-09 12:22:15,771 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 12:22:15,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 12:22:15,774 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 491 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:22:15,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 657 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:22:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 12:22:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 202. [2025-01-09 12:22:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 125 states have internal predecessors, (152), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:22:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 296 transitions. [2025-01-09 12:22:15,826 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 296 transitions. Word has length 139 [2025-01-09 12:22:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:22:15,827 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 296 transitions. [2025-01-09 12:22:15,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 5 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 5 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 12:22:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2025-01-09 12:22:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:22:15,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:15,830 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:15,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:22:16,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:22:16,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2143813444, now seen corresponding path program 1 times [2025-01-09 12:22:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:22:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128436844] [2025-01-09 12:22:16,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:22:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:16,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:16,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:16,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:22:16,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:22:16,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:22:16,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:22:16,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:22:16,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:22:16,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:22:16,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:22:16,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:22:16,214 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 12:22:16,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:22:16,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:22:16 BoogieIcfgContainer [2025-01-09 12:22:16,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:22:16,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:22:16,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:22:16,301 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:22:16,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:10" (3/4) ... [2025-01-09 12:22:16,303 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:22:16,304 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:22:16,304 INFO L158 Benchmark]: Toolchain (without parser) took 6635.12ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 158.0MB in the beginning and 90.7MB in the end (delta: 67.3MB). Peak memory consumption was 134.6MB. Max. memory is 16.1GB. [2025-01-09 12:22:16,304 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:22:16,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.40ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 143.9MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:22:16,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 141.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:22:16,305 INFO L158 Benchmark]: Boogie Preprocessor took 26.04ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:22:16,305 INFO L158 Benchmark]: RCFGBuilder took 307.83ms. Allocated memory is still 201.3MB. Free memory was 138.1MB in the beginning and 118.0MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:22:16,305 INFO L158 Benchmark]: TraceAbstraction took 6026.04ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 117.5MB in the beginning and 90.8MB in the end (delta: 26.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2025-01-09 12:22:16,306 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 268.4MB. Free memory was 90.8MB in the beginning and 90.7MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:22:16,306 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.38ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.40ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 143.9MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 141.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.04ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.83ms. Allocated memory is still 201.3MB. Free memory was 138.1MB in the beginning and 118.0MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6026.04ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 117.5MB in the beginning and 90.8MB in the end (delta: 26.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 268.4MB. Free memory was 90.8MB in the beginning and 90.7MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 7.325; [L23] double var_1_3 = 63.8; [L24] double var_1_4 = 256.6; [L25] double var_1_5 = 2.375; [L26] double var_1_6 = 25.8; [L27] unsigned char var_1_7 = 1; [L28] double var_1_8 = 1.5; [L29] unsigned long int var_1_9 = 32; [L30] unsigned long int var_1_10 = 3567543019; [L31] float var_1_12 = 31.875; [L32] signed long int var_1_13 = 128; [L33] unsigned char var_1_16 = 4; [L34] unsigned char var_1_18 = 16; [L35] signed long int var_1_19 = 64; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = 1897833385; [L38] unsigned char var_1_22 = 2; [L39] signed char var_1_23 = -5; [L40] signed char var_1_24 = -4; [L41] signed char var_1_25 = 2; [L42] signed long int var_1_26 = -1000000; [L43] float last_1_var_1_12 = 31.875; [L44] signed long int last_1_var_1_13 = 128; [L45] unsigned char last_1_var_1_16 = 4; [L46] signed long int last_1_var_1_19 = 64; VAL [isInitial=0, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L135] isInitial = 1 [L136] FCALL initially() [L138] CALL updateLastVariables() [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_13 = var_1_13 [L127] last_1_var_1_16 = var_1_16 [L128] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_3=319/5, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L90] var_1_3 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L91] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_4=1283/5, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L92] var_1_4 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L93] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_5=19/8, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L94] var_1_5 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L95] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L96] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_6=129/5, var_1_7=1, var_1_8=3/2, var_1_9=32] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L99] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L100] var_1_7 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_8=3/2, var_1_9=32] [L102] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L102] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_8=3/2, var_1_9=32] [L103] var_1_8 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L104] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=3567543019, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L105] var_1_10 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_10 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L106] RET assume_abort_if_not(var_1_10 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L107] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=16, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L108] var_1_18 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L110] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=0, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L111] var_1_20 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L112] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L113] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1897833385, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L114] var_1_21 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_21 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L115] RET assume_abort_if_not(var_1_21 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L116] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=-4, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L117] var_1_24 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_24 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L118] RET assume_abort_if_not(var_1_24 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L119] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=2, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L120] var_1_25 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_25 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L121] RET assume_abort_if_not(var_1_25 >= -126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L122] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=255/8, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_9=32] [L139] RET updateVariables() [L140] CALL step() [L50] COND TRUE (((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10 [L51] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=293/40, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L53] COND FALSE !(var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) [L60] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=4, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L62] COND TRUE var_1_3 >= (last_1_var_1_12 * var_1_4) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=2, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L65] var_1_22 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=-5, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L66] COND TRUE var_1_1 > var_1_5 [L67] var_1_23 = (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=-1000000, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L71] var_1_26 = var_1_25 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] EXPR var_1_26 >> var_1_10 VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=128, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L72] signed long int stepLocal_0 = var_1_26 >> var_1_10; [L73] COND TRUE stepLocal_0 < last_1_var_1_13 [L74] var_1_13 = ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=32] [L76] COND TRUE var_1_1 < (var_1_4 - var_1_3) [L77] var_1_9 = (var_1_10 - var_1_16) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=64, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L79] COND TRUE var_1_7 && var_1_20 [L80] var_1_19 = ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR ((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L131-L132] return (((((((((var_1_12 > ((var_1_3 - var_1_4) / ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_7 ? (var_1_1 == ((double) var_1_8)) : (var_1_1 == ((double) var_1_8))) : (var_1_1 == ((double) var_1_8))) && ((var_1_1 < (var_1_4 - var_1_3)) ? (var_1_9 == ((unsigned long int) (var_1_10 - var_1_16))) : 1)) && (((((((last_1_var_1_19 / 2)) > ((~ last_1_var_1_16))) ? ((last_1_var_1_19 / 2)) : ((~ last_1_var_1_16)))) <= var_1_10) ? (var_1_12 == ((float) var_1_8)) : 1)) && (((var_1_26 >> var_1_10) < last_1_var_1_13) ? (var_1_13 == ((signed long int) ((((var_1_26) < (var_1_22)) ? (var_1_26) : (var_1_22))))) : 1)) && ((var_1_3 >= (last_1_var_1_12 * var_1_4)) ? (var_1_16 == ((unsigned char) var_1_18)) : 1)) && ((var_1_7 && var_1_20) ? (var_1_19 == ((signed long int) ((1827081742 - var_1_13) - (var_1_21 - (var_1_18 + var_1_16))))) : ((2u >= ((((var_1_21) > (var_1_9)) ? (var_1_21) : (var_1_9)))) ? (var_1_19 == ((signed long int) var_1_22)) : (var_1_19 == ((signed long int) var_1_22))))) && (var_1_22 == ((unsigned char) ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))) && ((var_1_1 > var_1_5) ? (var_1_23 == ((signed char) (((((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) < 0 ) ? -((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))) : ((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) : (var_1_23 == ((signed char) var_1_24)))) && (var_1_26 == ((signed long int) var_1_25)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=255/8, last_1_var_1_13=128, last_1_var_1_16=4, last_1_var_1_19=64, var_1_10=-2147483649, var_1_12=3567543024, var_1_13=0, var_1_16=0, var_1_18=0, var_1_19=0, var_1_1=3567543024, var_1_20=1, var_1_21=1827081742, var_1_22=0, var_1_23=0, var_1_24=126, var_1_25=0, var_1_26=0, var_1_7=1, var_1_8=3567543024, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 188 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 90 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 3536 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4061/4200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:22:16,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:22:18,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:22:18,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:22:18,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:22:18,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:22:18,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:22:18,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:22:18,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:22:18,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:22:18,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:22:18,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:22:18,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:22:18,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:22:18,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:22:18,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:22:18,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:22:18,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:18,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:18,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:22:18,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:22:18,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2884416ff292c4b713684b3affe0c9e5395d09878f2c24add1de527aeee527b6 [2025-01-09 12:22:18,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:22:18,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:22:18,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:22:18,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:22:18,651 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:22:18,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:19,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1a3486b0/e4f1697122f0412e971e7fe94cc2d082/FLAG2a1a27b79 [2025-01-09 12:22:20,058 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:22:20,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:20,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1a3486b0/e4f1697122f0412e971e7fe94cc2d082/FLAG2a1a27b79 [2025-01-09 12:22:20,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1a3486b0/e4f1697122f0412e971e7fe94cc2d082 [2025-01-09 12:22:20,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:22:20,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:22:20,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:22:20,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:22:20,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:22:20,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20, skipping insertion in model container [2025-01-09 12:22:20,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:22:20,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i[913,926] [2025-01-09 12:22:20,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:22:20,263 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:22:20,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-73.i[913,926] [2025-01-09 12:22:20,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:22:20,296 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:22:20,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20 WrapperNode [2025-01-09 12:22:20,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:22:20,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:22:20,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:22:20,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:22:20,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,331 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-01-09 12:22:20,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:22:20,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:22:20,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:22:20,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:22:20,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,357 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:22:20,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:22:20,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:22:20,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:22:20,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:22:20,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (1/1) ... [2025-01-09 12:22:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:22:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:22:20,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:22:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:22:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:22:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:22:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:22:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:22:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:22:20,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:22:20,522 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:22:20,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:22:37,490 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 12:22:37,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:22:37,501 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:22:37,502 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:22:37,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:37 BoogieIcfgContainer [2025-01-09 12:22:37,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:22:37,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:22:37,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:22:37,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:22:37,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:22:20" (1/3) ... [2025-01-09 12:22:37,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b2fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:37, skipping insertion in model container [2025-01-09 12:22:37,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:22:20" (2/3) ... [2025-01-09 12:22:37,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b2fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:22:37, skipping insertion in model container [2025-01-09 12:22:37,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:22:37" (3/3) ... [2025-01-09 12:22:37,509 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-73.i [2025-01-09 12:22:37,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:22:37,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-73.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:22:37,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:22:37,569 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;@4640658c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:22:37,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:22:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:22:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 12:22:37,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:37,579 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:37,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1354739497, now seen corresponding path program 1 times [2025-01-09 12:22:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:22:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340528191] [2025-01-09 12:22:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:37,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:22:37,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:22:37,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:22:37,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:22:37,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:22:38,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:22:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:38,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:22:38,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:22:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-01-09 12:22:38,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:22:38,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:22:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340528191] [2025-01-09 12:22:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340528191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:22:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:22:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:22:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414798344] [2025-01-09 12:22:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:22:38,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:22:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:22:38,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:22:38,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:22:38,583 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:22:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:22:38,598 INFO L93 Difference]: Finished difference Result 118 states and 202 transitions. [2025-01-09 12:22:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:22:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 12:22:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:22:38,604 INFO L225 Difference]: With dead ends: 118 [2025-01-09 12:22:38,604 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 12:22:38,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:22:38,608 INFO L435 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:22:38,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:22:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 12:22:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 12:22:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:22:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-01-09 12:22:38,661 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 135 [2025-01-09 12:22:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:22:38,665 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-01-09 12:22:38,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:22:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-01-09 12:22:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 12:22:38,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:38,667 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:38,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:22:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:22:38,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1621222937, now seen corresponding path program 1 times [2025-01-09 12:22:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:22:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807591783] [2025-01-09 12:22:38,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:38,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:22:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:22:38,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:22:38,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:22:38,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:22:39,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:22:39,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:39,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:39,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:22:39,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:22:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 12:22:44,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:22:44,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:22:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807591783] [2025-01-09 12:22:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807591783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:22:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1776153514] [2025-01-09 12:22:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:44,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:22:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:22:44,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:22:44,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 12:22:44,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:22:46,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:22:46,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:46,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:46,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:22:46,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:22:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:22:49,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:22:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1776153514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:22:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:22:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 12:22:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308500592] [2025-01-09 12:22:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:22:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:22:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:22:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:22:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:22:49,433 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:22:53,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:22:58,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:22:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:22:58,161 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-01-09 12:22:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:22:58,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-01-09 12:22:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:22:58,202 INFO L225 Difference]: With dead ends: 172 [2025-01-09 12:22:58,202 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 12:22:58,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:22:58,203 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:22:58,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 286 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2025-01-09 12:22:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 12:22:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-01-09 12:22:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:22:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 160 transitions. [2025-01-09 12:22:58,229 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 160 transitions. Word has length 135 [2025-01-09 12:22:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:22:58,229 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 160 transitions. [2025-01-09 12:22:58,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:22:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 160 transitions. [2025-01-09 12:22:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 12:22:58,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:22:58,236 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:22:58,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:22:58,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 12:22:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 12:22:58,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:22:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:22:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash 898736997, now seen corresponding path program 1 times [2025-01-09 12:22:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:22:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161043971] [2025-01-09 12:22:58,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:22:58,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:22:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:22:58,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:22:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 12:22:58,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:22:59,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:22:59,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:22:59,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:22:59,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:22:59,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:23:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 12:23:03,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:23:04,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:23:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161043971] [2025-01-09 12:23:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161043971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:23:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094689452] [2025-01-09 12:23:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:23:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:23:04,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:23:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 12:23:04,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:23:06,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:23:06,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:06,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:06,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:23:06,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:23:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 434 proven. 33 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 12:23:09,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:23:10,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1094689452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:23:10,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:23:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-01-09 12:23:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22252318] [2025-01-09 12:23:10,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:23:10,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:23:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:23:10,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:23:10,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:23:10,129 INFO L87 Difference]: Start difference. First operand 106 states and 160 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:23:16,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:23:20,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:23:25,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:23:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:26,097 INFO L93 Difference]: Finished difference Result 185 states and 274 transitions. [2025-01-09 12:23:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:23:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-01-09 12:23:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:26,144 INFO L225 Difference]: With dead ends: 185 [2025-01-09 12:23:26,145 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 12:23:26,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:23:26,145 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 94 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:26,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 295 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-01-09 12:23:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 12:23:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2025-01-09 12:23:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:23:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2025-01-09 12:23:26,177 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 135 [2025-01-09 12:23:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:26,178 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2025-01-09 12:23:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:23:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2025-01-09 12:23:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 12:23:26,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:26,180 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:26,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:23:26,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 12:23:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:23:26,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:26,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1485543011, now seen corresponding path program 1 times [2025-01-09 12:23:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:23:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837940926] [2025-01-09 12:23:26,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:26,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:23:26,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:23:26,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:23:26,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 12:23:26,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 12:23:27,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 12:23:27,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:27,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 12:23:27,537 INFO L279 TraceCheckSpWp]: Computing forward predicates...